+612 9045 4394
 
CHECKOUT
Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, Proceedings - Friedrich Eisenbrand

Integer Programming and Combinatorial Optimization

14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, Proceedings

By: Friedrich Eisenbrand (Editor), Bruce Shepherd (Editor)

Paperback

Published: 1st June 2010
Ships: 7 to 10 business days
7 to 10 business days
RRP $315.99
$218.80
31%
OFF
or 4 easy payments of $54.70 with Learn more

Other Available Formats (Hide)

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.

Solving LP Relaxations of Large-Scale Precedence Constrained Problemsp. 1
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packingsp. 15
Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problemsp. 29
Restricted b-Matchings in Degree-Bounded Graphsp. 43
Zero-Coefficient Cutsp. 57
Prize-Collecting Steiner Network Problemsp. 71
On Lifting Integer Variables in Minimal Inequalitiesp. 85
Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivitiesp. 96
On Generalizations of Network Design Problems with Degree Boundsp. 110
A Polyhedral Study of the Mixed Integer Cutp. 124
Symmetry Matters for the Sizes of Extended Formulationsp. 135
A 3-Approximation for Facility Location with Uniform Capacitiesp. 149
Secretary Problems via Linear Programmingp. 163
Branched Polyhedral Systemsp. 177
Hitting Diamonds and Growing Cactip. 191
Approximability of 3- and 4-Hop Bounded Disjoint Paths Problemsp. 205
A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programsp. 219
Universal Sequencing on a Single Machinep. 230
Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithmp. 244
Integer Quadratic Quasi-polyhedrap. 258
An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programsp. 271
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programmingp. 285
Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGainp. 299
The Price of Collusion in Series-Parallel Networksp. 313
The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedronp. 327
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Informationp. 341
On Column-Restricted and Priority Covering Integer Programsp. 355
On k-Column Sparse Packing Programsp. 369
Hypergraphic LP Relaxations for Steiner Treesp. 383
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphsp. 397
Efficient Algorithms for Average Completion Time Schedulingp. 411
Experiments with Two Row Tableau Cutsp. 424
An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengthsp. 438
On the Rank of Cutting-Plane Proof Systemsp. 450
Author Indexp. 465
Table of Contents provided by Ingram. All Rights Reserved.

ISBN: 9783642130359
ISBN-10: 3642130356
Series: Theoretical Computer Science and General Issues
Audience: Professional
Format: Paperback
Language: English
Number Of Pages: 466
Published: 1st June 2010
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.5 x 15.88  x 2.54
Weight (kg): 0.73