IPCO B

35 papers

YearTitle / Authors
2010A 3-Approximation for Facility Location with Uniform Capacities.
Ankit Aggarwal, Anand Louis, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain
2010A Polyhedral Study of the Mixed Integer Cut.
Steve Tyber, Ellis L. Johnson
2010A Polynomial-Time Algorithm for Optimizing over
Raymond Hemmecke, Matthias Köppe, Robert Weismantel
2010A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
2010An
Klaus Jansen, Roberto Solis-Oba
2010An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming.
Christoph Buchheim, Alberto Caprara, Andrea Lodi
2010An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs.
James R. Luedtke
2010Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems.
Andreas Bley, José Neto
2010Branched Polyhedral Systems.
Volker Kaibel, Andreas Loos
2010Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings.
Takuro Fukunaga
2010Efficient Algorithms for Average Completion Time Scheduling.
René Sitters
2010Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs.
Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi
2010Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities.
Lap Chi Lau, Chun Kong Yung
2010Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems.
Daniel Bienstock
2010Experiments with Two Row Tableau Cuts.
Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey
2010Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain.
Siavosh Benabbas, Avner Magen
2010Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm.
Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy
2010Hitting Diamonds and Growing Cacti.
Samuel Fiorini, Gwenaël Joret, Ugo Pietropaoli
2010Hypergraphic LP Relaxations for Steiner Trees.
Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
2010Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings
Friedrich Eisenbrand, F. Bruce Shepherd
2010Integer Quadratic Quasi-polyhedra.
Adam N. Letchford
2010On
Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan
2010On Column-Restricted and Priority Covering Integer Programs.
Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann
2010On Generalizations of Network Design Problems with Degree Bounds.
Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis
2010On Lifting Integer Variables in Minimal Inequalities.
Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010On the Rank of Cutting-Plane Proof Systems.
Sebastian Pokutta, Andreas S. Schulz
2010Prize-Collecting Steiner Network Problems.
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2010Restricted
Kristóf Bérczi, László A. Végh
2010Secretary Problems via Linear Programming.
Niv Buchbinder, Kamal Jain, Mohit Singh
2010Solving LP Relaxations of Large-Scale Precedence Constrained Problems.
Daniel Bienstock, Mark Zuckerberg
2010Symmetry Matters for the Sizes of Extended Formulations.
Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis
2010The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron.
Santanu S. Dey, Juan Pablo Vielma
2010The Price of Collusion in Series-Parallel Networks.
Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang
2010Universal Sequencing on a Single Machine.
Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie
2010Zero-Coefficient Cuts.
Kent Andersen, Robert Weismantel