----------------------------------------------------------------
IPCO XIV, 2010 (Lausanne):  List of accepted papers   
----------------------------------------------------------------

Daniel Bienstock and Mark Zuckerberg. 
Solving LP relaxations of large precedence-constrained problems

Takuro Fukunaga. 
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings

Daniel Bienstock. 
Eigenvalue techniques for convex objective, nonconvex optimization problems

Krist�f B�rczi and L�szl� A. V�gh. 
Restricted b-Matchings In Degree-Bounded Graphs

Kent Andersen and Robert Weismantel. 
Zero-coefficient cuts

MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz and Zeev Nutov. 
Prize-Collecting Steiner Network Problems

Amitabh Basu, Manoel Campelo, Conforti Michele, Gerard Cornu�jols and Giacomo Zambelli. 
On Lifting Integer Variables in Minimal Inequalities

Lap Chi Lau and Chun Kong Yung. 
Efficient Edge Splitting and Constrained Edge Splitting

Nikhil Bansal, Rohit Khandekar, Jochen Konemann, Viswanath Nagarajan and Britta Peis. 
On Generalizations of Network Design Problems with Degree Bounds

Steve Tyber and Ellis Johnson. 
A Polyhedral Study of the Mixed Integer Cut

Volker Kaibel, Kanstantsin Pashkovich and Dirk Oliver Theis. 
Symmetry Matters for Sizes of Extended Formulations

Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta and Surabhi Jain. 
A 3-approximation for facility location with uniform capacities

Niv Buchbinder, Kamal Jain and Mohit Singh. 
Secretary Problems via Linear Programming

Volker Kaibel and Andreas Loos. 
Polyhedral Branching Systems

Samuel Fiorini, Gwena�l Joret and Ugo Pietropaoli. 
Hitting Diamonds and Growing Cacti

Andreas Bley and Jose Neto. 
Approximability of 3- and 4-hop bounded disjoint paths problems

Raymond Hemmecke, Matthias K�ppe and Robert Weismantel. 
A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs

Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julian Mestre, Martin Skutella and Leen Stougie. 
Universal sequencing on a single machine

Jaroslaw Byrka, Aravind Srinivasan and Chaitanya Swamy. 
Fault-Tolerant Facility Location, a randomized dependent LP-rounding  algorithm

Adam Letchford. 
Integer Quadratic Quasi-Polyhedra

Zoltan Szigeti, Alexander Ageev and Andras Sebo. 
An Excluded Minor Characterization of Seymour Graphs

James Luedtke. 
An Integer Programming and Decomposition Approach to General  Chance-Constrained Mathematical Programs

Alberto Caprara, Christoph Buchheim and Andrea Lodi. 
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming

Siavosh Benabbas and Avner Magen. 
Extending SDP Integrality gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain

Umang Bhaskar, Lisa Fleischer and Chien-Chung Huang. 
The Price of Collusion in Series-Parallel Networks

Santanu Dey and Juan Pablo Vielma. 
The Chvatal-Gomory Closure of an Ellipsoid is a Polyhedron

Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Kazuhisa Makino. 
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information

Deeparnab Chakrabarty, Elyot Grant and Jochen Konemann. 
On Column-restricted and Priority Covering Integer Programs

Nikhil Bansal, Nitish Korula, Viswanath Nagarajan and Aravind Srinivasan. 
On k-Column Sparse Packing Programs

Deeparnab Chakrabarty, Jochen Konemann and David Pritchard. 
Hypergraphic LP Relaxations for Steiner Trees

Edoardo Amaldi, Claudio Iuliano and Romeo Rizzi. 
Efficient deterministic algorithms for finding a minimum cycle basis in undirected graphs

Rene Sitters. 
Efficient algorithms for average completion time scheduling

Santanu Dey, Andrea Lodi, Andrea Tramontani and Laurence Wolsey. 
Experiments With Two Row Tableau Cuts

Klaus Jansen and Roberto Solis-Oba. 
The high multiplicity bin packing problem

Sebastian Pokutta and Andreas S. Schulz. 
On the rank of cutting-plane proof systems