Theoretical Computer Science and General Issues

Integer Programming and Combinatorial Optimization

14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, Proceedings

Editors: Eisenbrand, Friedrich, Shepherd, Bruce (Eds.)

Buy this book

eBook $99.00
price for USA (gross)
  • ISBN 978-3-642-13036-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $129.00
price for USA
  • ISBN 978-3-642-13035-9
  • Free shipping for individuals worldwide
  • Online orders shipping within 2-3 days.
About this book

Theidea ofa refereedconferencefor the mathematicalprogrammingcommunity was proposed by Ravi Kannan and William Pulleyblank to the Mathematical Programming Society (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 tra- tionally considered. In any case, the interest in IPCO is greater than ever and this is re?ected in both the number (135) and quality of the submissions. The ProgrammeCommittee with 13 memberswasalsoIPCO’slargest. We thankthe members of the committee, as well as their sub-reviewers, for their exceptional (and time-consuming) work and especially during the 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 L- sanne. Unavoidably, this has meant that many excellent submissions were not able to be included.

Table of contents (34 chapters)

  • Solving LP Relaxations of Large-Scale Precedence Constrained Problems

    Bienstock, Daniel (et al.)

    Pages 1-14

  • Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings

    Fukunaga, Takuro

    Pages 15-28

  • Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems

    Bienstock, Daniel

    Pages 29-42

  • Restricted b-Matchings in Degree-Bounded Graphs

    Bérczi, Kristóf (et al.)

    Pages 43-56

  • Zero-Coefficient Cuts

    Andersen, Kent (et al.)

    Pages 57-70

Buy this book

eBook $99.00
price for USA (gross)
  • ISBN 978-3-642-13036-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $129.00
price for USA
  • ISBN 978-3-642-13035-9
  • Free shipping for individuals worldwide
  • Online orders shipping within 2-3 days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Integer Programming and Combinatorial Optimization
Book Subtitle
14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, Proceedings
Editors
  • Friedrich Eisenbrand
  • Bruce Shepherd
Series Title
Theoretical Computer Science and General Issues
Series Volume
6080
Copyright
2010
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-13036-6
DOI
10.1007/978-3-642-13036-6
Softcover ISBN
978-3-642-13035-9
Edition Number
1
Number of Pages
XIII, 466
Number of Illustrations and Tables
45 b/w illustrations
Topics