Theidea ofa refereedconferencefor the mathematicalprogrammingcommunity was proposed by Ravi Kannan and William Pulleyblank to the Mathematical Programming Society (MPS) in the late 1980s. Thus IPCO was born, and MPS has sponsored the conference as one of its main events since IPCO I at the University of Waterloo in 1990. The conference has become the main forum for recent results in Integer Programming and Combinatorial Optimization in the non-Symposium years. This volume compiles the papers presented at IPCO XIV held June 9-11, 2010, at EPFL in Lausanne. The scope of papers considered for IPCO XIV is likely broader than at IPCO I. This is sometimes due to the wealth of new questions and directions brought from related areas. It can also be due to the successful application of “math programming” techniques to models not tra- tionally considered. In any case, the interest in IPCO is greater than ever and this is re?ected in both the number (135) and quality of the submissions. The ProgrammeCommittee with 13 memberswasalsoIPCO’slargest. We thankthe members of the committee, as well as their sub-reviewers, for their exceptional (and time-consuming) work and especially during the online committee meeting held over January. The process resulted in the selection of 34 excellent research papers which were presented in non-parallel sessions over three days in L- sanne. Unavoidably, this has meant that many excellent submissions were not able to be included.
Author(s): Daniel Bienstock, Mark Zuckerberg (auth.), Friedrich Eisenbrand, F. Bruce Shepherd (eds.)
Series: Lecture Notes in Computer Science 6080 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010
Language: English
Pages: 466
Tags: Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Computer Graphics; Data Structures; Numeric Computing; Computer Communication Networks
Front Matter....Pages -
Solving LP Relaxations of Large-Scale Precedence Constrained Problems....Pages 1-14
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings....Pages 15-28
Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems....Pages 29-42
Restricted b -Matchings in Degree-Bounded Graphs....Pages 43-56
Zero-Coefficient Cuts....Pages 57-70
Prize-Collecting Steiner Network Problems....Pages 71-84
On Lifting Integer Variables in Minimal Inequalities....Pages 85-95
Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities....Pages 96-109
On Generalizations of Network Design Problems with Degree Bounds....Pages 110-123
A Polyhedral Study of the Mixed Integer Cut....Pages 124-134
Symmetry Matters for the Sizes of Extended Formulations....Pages 135-148
A 3-Approximation for Facility Location with Uniform Capacities....Pages 149-162
Secretary Problems via Linear Programming....Pages 163-176
Branched Polyhedral Systems....Pages 177-190
Hitting Diamonds and Growing Cacti....Pages 191-204
Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems....Pages 205-218
A Polynomial-Time Algorithm for Optimizing over N -Fold 4-Block Decomposable Integer Programs....Pages 219-229
Universal Sequencing on a Single Machine....Pages 230-243
Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm....Pages 244-257
Integer Quadratic Quasi-polyhedra....Pages 258-270
An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs....Pages 271-284
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming....Pages 285-298
Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain ....Pages 299-312
The Price of Collusion in Series-Parallel Networks....Pages 313-326
The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron....Pages 327-340
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information....Pages 341-354
On Column-Restricted and Priority Covering Integer Programs....Pages 355-368
On k -Column Sparse Packing Programs....Pages 369-382
Hypergraphic LP Relaxations for Steiner Trees....Pages 383-396
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs....Pages 397-410
Efficient Algorithms for Average Completion Time Scheduling....Pages 411-423
Experiments with Two Row Tableau Cuts....Pages 424-437
An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths....Pages 438-449
On the Rank of Cutting-Plane Proof Systems....Pages 450-463
Back Matter....Pages -
