2010
2010: IPCO XIV in Lausanne, Switzerland Program Committee: Alper Atamtürk (UC Berkeley) David Avis (McGill University) Friedrich Eisenbrand (EPFL) Oktay Günlük (IBM) Marcos Goycoolea (Universidad Adolfo Ibáñez) Satoru Iwata (Kyoto University) Tamás Király (Eötvös Loránd University, Budapest) François Margot (Carnegie Mellon University) F. Bruce Shepherd, PC chair (McGill University) Levent Tunçel (University of Waterloo) Santosh Vempala (Georgia Tech) Peter Winkler (Dartmouth College) Neal E. Young (UC Riverside) Accepted Papers: Daniel Bienstock and Mark Zuckerberg. Solving LP Relaxations of Large-Scale 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, Michele Conforti, Gérard Cornuéjols and Giacomo Zambelli. On Lifting Integer Variables in Minimal Inequalities. Lap Chi Lau and Chun Kong Yung. Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities. Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan and Britta Peis. On Generalizations of Network Design Problems with Degree Bounds. Steve Tyber and Ellis L. Johnson. A Polyhedral Study of the Mixed Integer Cut. Volker Kaibel, Kanstantsin Pashkovich and Dirk Oliver Theis. Symmetry Matters for the 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. Branched Polyhedral 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, Julián Mestre, Martin Skutella and Leen Stougie. Universal Sequencing on a Single Machine. Jarosław Byrka, Aravind Srinivasan and Chaitanya Swamy. Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. Adam N. Letchford. Integer Quadratic Quasi-polyhedra. James Luedtke. An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs. Christoph Buchheim, Alberto Caprara 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 S. Dey and Juan Pablo Vielma. The Chvátal-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 Könemann. 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 Könemann 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. René Sitters. Efficient Algorithms for Average Completion Time Scheduling. Santanu S. Dey, Andrea Lodi, Andrea Tramontani and Laurence A. Wolsey. Experiments with Two Row Tableau Cuts. Klaus Jansen and Roberto Solis-Oba. An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths. Sebastian Pokutta and Andreas S. Schulz. On the Rank of Cutting-Plane Proof Systems.