Return to home page
Searching: Muskingum library catalog
Some OPAL libraries remain closed or are operating at reduced service levels. Materials from those libraries may not be requestable; requested items may take longer to arrive. Note that pickup procedures may differ between libraries. Please contact your library for new procedures, specific requests, or other assistance.
  Previous Record Previous Item Next Item Next Record
  Reviews, Summaries, etc...
Conference Conference on Integer Programming and Combinatorial Optimization (14th : 2010 : Lausanne, Switzerland)
Title Integer programming and combinatorial optimization : 14th international conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010 ; proceedings / Friedrich Eisenbrand, F. Bruce Shepherd (eds.).
Imprint Berlin : Springer, 2010.

View online
View online
Conference Conference on Integer Programming and Combinatorial Optimization (14th : 2010 : Lausanne, Switzerland)
Series Lecture notes in computer science, 0302-9743 ; 6080
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Lecture notes in computer science ; 6080.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Subject Combinatorial optimization -- Congresses.
Integer programming -- Congresses.
Alt Name Eisenbrand, Friedrich.
Shepherd, F. Bruce (Frederick Bruce)
Add Title IPCO 2010
Description 1 online resource (xiii, 466 pages) : illustrations.
polychrome rdacc
Bibliography Note Includes bibliographical references.
Contents Solving LP relaxations of large-scale precedence constrained problems / Daniel Bienstock and Mark Zuckerberg -- Computing minimum multiway cuts in hypergraphs from hypertree packings / Takuro Fukunaga -- Eigenvalue techniques for convex objective, nonconvex optimization problems / Daniel Bienstock -- Restricted b-matchings in degree-bounded graphs / Kristof Berczi and Laszlo A. Vegh -- Zero-coefficient cuts / Kent Andersen and Robert Weismantel -- Prize-collecting Steiner network problems / MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, and Zeev Nutov -- On lifting integer variables in minimal inequalities / Amitabh Basu, Manoel Campelo, Michele Conforti, Gerard Cornuejols, and Giacomo Zambelli -- Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities / Lap Chi Lau and Chun Kong Yung -- On generalizations of network design problems with degree bounds / Nikhil Bansal, Rohit Khandekar, Jochen Konemann, Viswanath Nagarajan, and Britta Peis -- A polyhedral study of the mixed integer cut / Steve Tyber and Ellis L. Johnson -- Symmetry matters for the sizes of extended formulations / Volker Kaibel, Kanstantsin Pashkovich, and Dirk Oliver Theis -- A 3-approximation for facility location with uniform capacities / Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, and Surabhi Jain -- Secretary problems via linear programming / Niv Buchbinder, Kamal Jain, and Mohit Singh -- Branched polyhedral systems / Volker Kaibel and Andreas Loos -- Hitting diamonds and growing cacti / Samuel Fiorini, Gwenael Joret, and Ugo Pietropaoli -- Approximability of 3- and 4-hop bounded disjoint paths problems / Andreas Bley and Jose Neto -- A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs / Raymond Hemmecke, Matthias Koppe, and Robert Weismantel -- Universal sequencing on a single machine / Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julian Mestre, Martin Skutella, and Leen Stougie -- Fault-tolerant facility location : a randomized dependent LP-rounding algorithm / Jaroslaw Byrka, Aravind Srinivasan, and Chaitanya Swamy -- Integer quadratic quasi-polyhedra / Adam N. Letchford -- An integer programming and decomposition approach to general chance-constrained mathematical programs / James Luedtke -- An effective branch-and-bound algorithm for convex quadratic integer programming / Christoph Buchheim, Alberto Caprara, and Andrea Lodi -- Extending SDP integrality gaps to Sherali-Adams with applications to Quadratic Programming and MaxCutGain / Siavosh Benabbas and Avner Magen -- The price of collusion in series-parallel networks / Umang Bhaskar, Lisa Fleischer, and Chien-Chung Huang -- The Chvatal-Gomory closure of an ellipsoid is a polyhedron / Santanu S. Dey and Juan Pablo Vielma -- A pumping algorithm for ergodic stochastic mean payoff games with perfect information / Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino -- On column-restricted and priority covering integer programs / Deeparnab Chakrabarty, Elyot Grant, and Jochen Konemann -- On k-column sparse packing programs / Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, and Aravind Srinivasan -- Hypergraphic LP relaxations for Steiner trees / Deeparnab Chakrabarty, Jochen Konemann, and David Pritchard -- Efficient deterministic algorithms for finding a minimum cycle basis in undirected graphs / Edoardo Amaldi, Claudio Iuliano, and Romeo Rizzi -- Efficient algorithms for average completion time scheduling / Rene Sitters -- Experiments with two row tableau cuts / 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 / Klaus Jansen and Roberto Solis-Oba -- On the rank of cutting-plane proof systems / Sebastian Pokutta and Andreas S. Schulz.
Summary Annotation This book constitutes the proceedings of the 14th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2010, held in Lausanne, Switzerland in June 2010. The 34 papers presented were carefully reviewed and selected from 135 submissions. The conference has become the main forum for recent results in integer programming and combinatorial optimization in the non-symposium years.
Note Print version record.
ISBN 9783642130366
9783642130359 (pbk.)
3642130356 (pbk.)
ISBN/ISSN 10.1007/978-3-642-13036-6
OCLC # 654396247
Additional Format Print version: Conference on Integer Programming and Combinatorial Optimization (14th : 2010 : Lausanne, Switzerland). Integer programming and combinatorial optimization. Berlin : Springer, 2010 9783642130359 3642130356 (OCoLC)641458801

If you experience difficulty accessing or navigating this content, please contact the OPAL Support Team