14. IPCO 2010: Lausanne, Switzerland
Friedrich Eisenbrand, F. Bruce Shepherd (Eds.): Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings. Springer 2010 Lecture Notes in Computer Science ISBN 978-3-642-13035-9- Daniel Bienstock, Mark Zuckerberg: Solving LP Relaxations of Large-Scale Precedence Constrained Problems. 1-14
- Takuro Fukunaga: Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings. 15-28
- Daniel Bienstock: Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems. 29-42
- MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Prize-Collecting Steiner Network Problems. 71-84
- Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli: On Lifting Integer Variables in Minimal Inequalities. 85-95
- Lap Chi Lau, Chun Kong Yung: Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities. 96-109
- Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis: On Generalizations of Network Design Problems with Degree Bounds. 110-123
- Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis: Symmetry Matters for the Sizes of Extended Formulations. 135-148
- Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain: A 3-Approximation for Facility Location with Uniform Capacities. 149-162
- Raymond Hemmecke, Matthias Köppe, Robert Weismantel: A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs. 219-229
- Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie: Universal Sequencing on a Single Machine. 230-243
- Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy: Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. 244-257
- Adam N. Letchford: Integer Quadratic Quasi-polyhedra. 258-270
- James Luedtke: An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs. 271-284
- Christoph Buchheim, Alberto Caprara, Andrea Lodi: An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming. 285-298
- Siavosh Benabbas, Avner Magen: Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain. 299-312
- Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang: The Price of Collusion in Series-Parallel Networks. 313-326
- Santanu S. Dey, Juan Pablo Vielma: The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron. 327-340
- Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. 341-354
- Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann: On Column-Restricted and Priority Covering Integer Programs. 355-368
- Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan: On k-Column Sparse Packing Programs. 369-382
- Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Hypergraphic LP Relaxations for Steiner Trees. 383-396
- Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi: Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. 397-410
- René Sitters: Efficient Algorithms for Average Completion Time Scheduling. 411-423
- Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey: Experiments with Two Row Tableau Cuts. 424-437
- Klaus Jansen, Roberto Solis-Oba: An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths. 438-449
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team