## Integer Programming and Combinatorial Optimization: 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, ProceedingsTheidea 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Solving LP Relaxations of LargeScale Precedence Constrained Problems | 1 |

Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings | 15 |

Eigenvalue Techniques for Convex Objective Nonconvex Optimization Problems | 29 |

Restricted bMatchings in DegreeBounded Graphs | 43 |

ZeroCoefficient Cuts | 57 |

PrizeCollecting Steiner Network Problems | 71 |

On Lifting Integer Variables in Minimal Inequalities | 85 |

Efficient Edge SplittingOff Algorithms Maintaining AllPairs EdgeConnectivities | 96 |

A Randomized Dependent LPRounding Algorithm | 244 |

Integer Quadratic Quasipolyhedra | 258 |

An Integer Programming and Decomposition Approach to General ChanceConstrained Mathematical Programs | 271 |

An Effective BranchandBound Algorithm for Convex Quadratic Integer Programming | 285 |

Extending SDP Integrality Gaps toSheraliAdams with Applications to sc Quadratic Programming and sc MaxCutGain | 299 |

The Price of Collusion in SeriesParallel Networks | 313 |

The ChvatalGomory Closure of an Ellipsoid Is aPolyhedron | 327 |

A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information | 341 |

On Generalizations of Network Design Problems with Degree Bounds | 110 |

A Polyhedral Study of the Mixed Integer Cut | 124 |

Symmetry Matters for the Sizes of Extended Formulations | 135 |

A 3Approximation for Facility Location with Uniform Capacities | 149 |

Secretary Problems via Linear Programming | 163 |

Branched Polyhedral Systems | 177 |

Hitting Diamonds and Growing Cacti | 191 |

Approximability of 3 and 4Hop Bounded Disjoint Paths Problems | 205 |

A PolynomialTime Algorithm for Optimizingover NFold 4Block Decomposable Integer Programs | 219 |

Universal Sequencing on a Single Machine | 230 |

On ColumnRestricted and Priority Covering Integer Programs | 355 |

On kColumn Sparse Packing Programs | 369 |

Hypergraphic LP Relaxations for Steiner Trees | 383 |

Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs | 397 |

Efficient Algorithms for Average Completion Time Scheduling | 411 |

Experiments with Two Row Tableau Cuts | 424 |

An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths | 438 |

On the Rank of CuttingPlane Proof Systems | 450 |

464 | |

### Other editions - View all

### Common terms and phrases

approximation algorithm BWR-game candidate client coeﬃcients combinatorial combinatorial optimization compute consider constraints contains convex hull convex set Corollary corresponding cost CPLEX cutting planes cycles define deﬁned deﬁnition degree bounds denote diﬀerent edge edge-connectivity eﬃcient Eisenbrand extended formulations facets facility feasible solution feedback vertex set ﬁnd ﬁnding ﬁrst ﬁxed ﬂow function given graph G Hence hyperedges hypergraph implies instance integer points integer programming integrality gap IPCO iteration Lemma linear program LNCS lower bound LP relaxation Math Mathematical Programming matrix matroid maximal mechanism minimal minimum mixed integer nodes NP-hard obtain optimal solution optimum pair partition paths player polyhedra polyhedron polynomial polytope proof prove quadratic random result routing games satisﬁes scheduling secretary problem Section series-parallel graph Sherali-Adams solve spanning tree splitting-oﬀ Springer Steiner tree subgraph submodular subset Theorem upper bound valid inequalities variables vector vertex vertices weight