Integer Programming and Combinatorial Optimization: 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings PDF
Preview Integer Programming and Combinatorial Optimization: 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings
Lecture Notes in Computer Science 6080 CommencedPublicationin1973 FoundingandFormerSeriesEditors: GerhardGoos,JurisHartmanis,andJanvanLeeuwen EditorialBoard DavidHutchison LancasterUniversity,UK TakeoKanade CarnegieMellonUniversity,Pittsburgh,PA,USA JosefKittler UniversityofSurrey,Guildford,UK JonM.Kleinberg CornellUniversity,Ithaca,NY,USA AlfredKobsa UniversityofCalifornia,Irvine,CA,USA FriedemannMattern ETHZurich,Switzerland JohnC.Mitchell StanfordUniversity,CA,USA MoniNaor WeizmannInstituteofScience,Rehovot,Israel OscarNierstrasz UniversityofBern,Switzerland C.PanduRangan IndianInstituteofTechnology,Madras,India BernhardSteffen TUDortmundUniversity,Germany MadhuSudan MicrosoftResearch,Cambridge,MA,USA DemetriTerzopoulos UniversityofCalifornia,LosAngeles,CA,USA DougTygar UniversityofCalifornia,Berkeley,CA,USA GerhardWeikum Max-PlanckInstituteofComputerScience,Saarbruecken,Germany Friedrich Eisenbrand F. Bruce Shepherd (Eds.) Integer Programming and Combinatorial Optimization 14th International Conference, IPCO 2010 Lausanne, Switzerland, June 9-11, 2010 Proceedings 1 3 VolumeEditors FriedrichEisenbrand ÉcolePolytechniqueFéderaledeLausanne InstituteofMathematics 1015Lausanne,Switzerland E-mail:friedrich.eisenbrand@epfl.ch F.BruceShepherd McGillUniversity DepartmentofMathematicsandStatistics 805SherbrookeWest,Montreal,Quebec,H3A2K6,Canada E-mail:[email protected] LibraryofCongressControlNumber:2010926408 CRSubjectClassification(1998):F.2,E.1,I.3.5,G.2,G.1.6,F.2.2 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ISSN 0302-9743 ISBN-10 3-642-13035-6SpringerBerlinHeidelbergNewYork ISBN-13 978-3-642-13035-9SpringerBerlinHeidelbergNewYork Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting, reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965, initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable toprosecutionundertheGermanCopyrightLaw. springer.com ©Springer-VerlagBerlinHeidelberg2010 PrintedinGermany Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India Printedonacid-freepaper 06/3180 Preface Theideaofarefereedconferenceforthemathematicalprogrammingcommunity was proposed by Ravi Kannan and William Pulleyblank to the Mathematical ProgrammingSociety (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 tradi- tionally considered. In any case, the interest in IPCO is greater than ever and this is reflected in both the number (135) and quality of the submissions. The ProgrammeCommitteewith13memberswasalsoIPCO’slargest.Wethankthe members of the committee, as well as their sub-reviewers, for their exceptional (andtime-consuming)workandespecially duringthe 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 Lau- sanne. Unavoidably, this has meant that many excellent submissions were not able to be included. As is typical, we would expect to see full versions of many of the IPCO papers in scientific journals in the not too distant future. Finally, a sincere thanks to all authors who submitted their current research to IPCO. It is this support that determines the excellence of the conference. March 2010 Friedrich Eisenbrand Bruce Shepherd Conference Organization Programme Committee Alper Atamtu¨rk UC Berkeley David Avis McGill Friedrich Eisenbrand EPFL Marcos Goycoolea Adolfo Iban˜ez Oktay Gu¨nlu¨k IBM Satoru Iwata Kyoto Tam´as Kira´ly Eo¨tvo¨s Budapest Franc¸ois Margot CMU Bruce Shepherd (Chair) McGill Levent Tun¸cel Waterloo Santosh Vempala Georgia Tech Peter Winkler Dartmouth Neal E. Young UC Riverside Local Organization Michel Bierlaire Jocelyne Blanc Friedrich Eisenbrand (Chair) Thomas Liebling Martin Niemeier Thomas Rothvoß Laura Sanita` External Reviewers Tobias Achterberg John Birge Ernst Althaus Jaroslaw Byrka Reid Andersen Alberto Caprara Matthew Andrews Deeparnab Chakrabarty Elliot Anshelevich Chandra Chekuri Gary Au Kevin Cheung Mourad Baiou Marek Chrobak Nina Balcan Jose Coelho de Pina Nikhil Bansal Michelangelo Conforti Andre Berger Miguel Constantino Attila Berna´th Jose Correa Dan Bienstock Sanjeeb Dash VIII Organization Santanu Dey Tamas Kis David Eppstein Robert Kleinberg Daniel Espinoza Yusuke Kobayashi Guy Even Jochen Ko¨nemann Uriel Feige Lingchen Kong Zsolt Fekete Nitish Korula Christina Fernandes Christos Koufogiannakis Carlo Filippi Erika Kovacs Samuel Fiorini Marek Krcal Nathan Fisher Sven Krumke Lisa Fleischer Simge Kucukyavuz Keith Frikken Lap Chi Lau Tetsuya Fujie Monique Laurent Toshihiro Fujito Adam Letchford Ricardo Fukasawa Asaf Levin Joao Gouveia Sven Leyffer Marcos Goycoolea Christian Liebchen Fabrizio Grandoni Jeff Linderoth Betrand Guenin Quentin Louveaux Dave Hartvigsen James Luedtke Christoph Helmberg Avner Magen Hiroshi Hirai Da´niel Marx Dorit Hochbaum Monaldo Mastrolilli Chien-Chung Huang Kurt Mehlhorn Cor Hurkens Zoltan Miklos Sungjin Im Hiroyoshi Miwa Nicole Immorlica Atefeh Mohajeri Toshimasa Ishii Eduardo Moreno Takehiro Ito Yiannis Mourtos Garud Iyengar Kiyohito Nagano Kamal Jain Arkadi Nemirovski Klaus Jansen Martin Niemeier David Johnson Neil Olver Tibor Jordan Gianpaolo Oriolo Vincent Jost Gyula Pap Alpa´r Ju¨ttmer Julia Pap Satyen Kale Gabor Pataki George Karakostas Sebastian Pokutta Anna Karlin Imre Polik Sean Kennedy David Pritchard Rohit Khandekar Kirk Pruhs Sanjeev Khanna Linxia Qin Samir Khuller Maurice Queyranne Shuji Kijima R Ravi Zoltan Kiraly Gerhard Reinelt Organization IX Thomas Rothvoß Tamas Szantai Laura Sanita` Tami Tamir Andreas S. Schulz Torsten Tholey Andras Sebo Rekha Thomas David Shmoys L´aszl´o V´egh Marcel Silva Juan Vera Mohit Singh Adrian Vetta Christian Sommer Juan Pablo Vielma Gregory Sorkin Jan Vondrak Frits Spieksma David Wagner Clifford Stein Gerhard Woeginger Ruediger Stephan Mihalis Yannakakis Nicolas Stier-Moses Giacomo Zambelli Zoya Svitkina Rico Zenklusen Chaitanya Swamy Miklos Zoltan Jacint Szabo Table of Contents Solving LP Relaxations of Large-Scale Precedence Constrained Problems ....................................................... 1 Daniel Bienstock and Mark Zuckerberg Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings........................................................ 15 Takuro Fukunaga Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems ....................................................... 29 Daniel Bienstock Restricted b-Matchings in Degree-Bounded Graphs ................... 43 Kristo´f B´erczi and L´aszlo´ A. V´egh Zero-Coefficient Cuts ............................................. 57 Kent Andersen and Robert Weismantel Prize-Collecting Steiner Network Problems .......................... 71 MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, and Zeev Nutov On Lifting Integer Variables in Minimal Inequalities.................. 85 Amitabh Basu, Manoel Campelo, Michele Conforti, G´erard Cornu´ejols, and Giacomo Zambelli Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities .............................................. 96 Lap Chi Lau and Chun Kong Yung On Generalizations of Network Design Problems with Degree Bounds... 110 Nikhil Bansal, Rohit Khandekar, Jochen Ko¨nemann, Viswanath Nagarajan, and Britta Peis A PolyhedralStudy of the Mixed Integer Cut........................ 124 Steve Tyber and Ellis L. Johnson Symmetry Matters for the Sizes of Extended Formulations ............ 135 Volker Kaibel, Kanstantsin Pashkovich, and Dirk Oliver Theis A 3-Approximationfor Facility Location with Uniform Capacities...... 149 Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, and Surabhi Jain XII Table of Contents Secretary Problems via Linear Programming ........................ 163 Niv Buchbinder, Kamal Jain, and Mohit Singh Branched Polyhedral Systems ..................................... 177 Volker Kaibel and Andreas Loos Hitting Diamonds and Growing Cacti .............................. 191 Samuel Fiorini, Gwena¨el Joret, and Ugo Pietropaoli Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems .... 205 Andreas Bley and Jose Neto A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs ................................... 219 Raymond Hemmecke, Matthias Ko¨ppe, and Robert Weismantel Universal Sequencing on a Single Machine........................... 230 Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julia´n Mestre, Martin Skutella, and Leen Stougie Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm .......................................... 244 Jaroslaw Byrka, Aravind Srinivasan, and Chaitanya Swamy Integer Quadratic Quasi-polyhedra................................. 258 Adam N. Letchford An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs ........................ 271 James Luedtke An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming............................................. 285 Christoph Buchheim, Alberto Caprara, and Andrea Lodi Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain .................. 299 Siavosh Benabbas and Avner Magen The Price of Collusion in Series-ParallelNetworks.................... 313 Umang Bhaskar, Lisa Fleischer, and Chien-Chung Huang The Chva´tal-Gomory Closure of an Ellipsoid Is a Polyhedron.......... 327 Santanu S. Dey and Juan Pablo Vielma A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information .............................................. 341 Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino Table of Contents XIII On Column-Restricted and Priority Covering Integer Programs ........ 355 Deeparnab Chakrabarty, Elyot Grant, and Jochen Ko¨nemann On k-Column Sparse Packing Programs............................. 369 Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, and Aravind Srinivasan Hypergraphic LP Relaxations for Steiner Trees ...................... 383 Deeparnab Chakrabarty, Jochen Ko¨nemann, and David Pritchard Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs............................................. 397 Edoardo Amaldi, Claudio Iuliano, and Romeo Rizzi Efficient Algorithms for Average Completion Time Scheduling ......... 411 Ren´e Sitters Experiments with Two Row Tableau Cuts........................... 424 Santanu S. Dey, Andrea Lodi, Andrea Tramontani, and Laurence A. Wolsey An OPT +1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths ........................................ 438 Klaus Jansen and Roberto Solis-Oba On the Rank of Cutting-Plane Proof Systems........................ 450 Sebastian Pokutta and Andreas S. Schulz Author Index.................................................. 465
The list of books you might like
