Integer Programming and Combinatorial Optimization : 5th International IPCO Conference Vancouver, British Columbia, Canada June 3–5, 1996 Proceedings. 1st ed. 1996

種類:

電子ブック

責任表示:

edited by William H. Cunningham, S. Thomas McCormick, Maurice Queyranne

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1996

著者名:

• Cunningham, William H.
• McCormick, S. Thomas.
• Queyranne, Maurice.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 1084

ISBN:

9783540684534 [3540684530]    

注記:

Colourful linear programming -- Test sets and inequalities for integer programs -- An optimal, stable continued fraction algorithm for arbitrary dimension -- Algorithms and extended formulations for one and two facility network design -- Integer multicommodity flow problems -- A heuristic algorithm for the set covering problem -- An ?-Relaxation method for generalized separable convex cost network flow problems -- Finding real-valued single-source shortest paths in o(n 3) expected time -- A network-flow technique for finding low-weight bounded-degree spanning trees -- Approximating k-set cover and complementary graph coloring -- On minimum 3-cuts and approximating k-cuts using Cut Trees -- Primal-dual approximation algorithms for feedback problems in planar graphs -- Cone-LP's and semidefinite programs: Geometry and a simplex-type method -- Quadratic knapsack relaxations using cutting planes and semidefinite programming -- A semidefinite bound for mixing rates of Markov chains -- The quadratic assignment prob
This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996. The 36 revised papers included in the book were selected from a total of 99 submissions; they highlight recent developments in theory, computation, and applications of integer programming and combinatorial optimization. The volume is organized in sections on integer programming theory and models, network flow algorithms, approximation algorithms, semi-definite methods, matrix models, set systems and submodularity, scheduling, probabilistic methods, polyhedral methods, and the traveling salesman problem.

ローカル注記:

学内専用E-BOOKS (local access only)