Skip to main content
SpringerLink
Log in
Book cover

Integer Programming and Combinatorial Optimization

11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings

  • Conference proceedings
  • © 2005

Overview

Editors:
  1. Michael Jünger

    1. Institut für Informatik, Universität zu Köln,  

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Volker Kaibel

    1. Fakultät für Mathematik, Otto-von-Guericke Universität Magdeburg, Magdeburg, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3509)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: IPCO 2005.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (34 papers)

  1. Front Matter

    Download chapter PDF

  2. Mixed-Integer Cuts from Cyclic Groups

    • Matteo Fischetti, Cristiano Saturni
    Pages 1-11

  3. Optimizing over the First Chvàtal Closure

    • Matteo Fischetti, Andrea Lodi
    Pages 12-22

  4. Sequential Pairing of Mixed Integer Inequalities

    • Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
    Pages 23-34

  5. Approximate Min-max Relations for Odd Cycles in Planar Graphs

    • Samuel Fiorini, Nadia Hardy, Bruce Reed, Adrian Vetta
    Pages 35-50

  6. Disjoint Cycles: Integrality Gap, Hardness, and Approximation

    • Mohammad R. Salavatipour, Jacques Verstraete
    Pages 51-65

  7. A Combinatorial Algorithm to Find a Maximum Even Factor

    • Gyula Pap
    Pages 66-80

  8. Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems

    • Fabián A. Chudak, Vânia Eleutério
    Pages 81-96

  9. On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem

    • Andreas Bley
    Pages 97-110

  10. Inventory and Facility Location Models with Market Selection

    • Retsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys
    Pages 111-124

  11. On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

    • Anthony Man–Cho So, Jiawei Zhang, Yinyu Ye
    Pages 125-135

  12. Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials

    • Nebojša Gvozdenović, Monique Laurent
    Pages 136-151

  13. Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring

    • G. Iyengar, D. J. Phillips, C. Stein
    Pages 152-166

  14. On the Inefficiency of Equilibria in Congestion Games

    • José R. Correa, Andreas S. Schulz, Nicolás E. Stier-Moses
    Pages 167-181

  15. Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times

    • Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
    Pages 182-195

  16. LP-Based Online Scheduling: From Single to Parallel Machines

    • José R. Correa, Michael R. Wagner
    Pages 196-209

  17. Unique Sink Orientations of Grids

    • Bernd Gärtner, Walter D. Morris, Leo Rüst
    Pages 210-224

  18. Jumping Doesn’t Help in Abstract Cubes

    • Ingo Schurr, Tibor Szabó
    Pages 225-235

  19. Computing the Inertia from Sign Patterns

    • Naonori Kakimura, Satoru Iwata
    Pages 236-248

  20. Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem

    • Edoardo Amaldi, Pietro Belotti, Raphael Hauser
    Pages 249-264
Back to top

Other volumes

  1. Integer Programming and Combinatorial Optimization

Keywords

About this book

Since its start in 1990, the IPCO conference series (held under the auspices of theMathematicalProgrammingSociety)hasbecomeanimportantforumforthe presentation of recent results in Integer Programming and Combinatorial Op- mization. This volume compiles the papers presented at IPCO XI, the eleventh conference in this series, held June 8–10, 2005, at the Technische Universit¨ at Berlin. The high interest in this conference series is evident in the large number of submissions. For IPCO XI, 119 extended abstracts of up to 10 pages were submitted. During its meeting on January 29–30, 2005, the Program Committee carefully selected 34 contributions for presentation in non-parallel sessions at the conference. The ?nal choices were not easy at all, since, due to the limited number of time slots, many very good papers could not be accepted. During the selection process the contributions were refereed according to the standards of refereed conferences. As a result of this procedure, you have in your hands a volume that contains papers describing high-quality research e?orts. The page limit for contributions to this proceedings volume was set to 15. You may ?nd full versions of the papers in scienti?c journals in the near future. We thank all the authors who submitted papers. Furthermore, the Program Committee is indebted to the many reviewers who, with their speci?c expertise, helped a lot in making the decisions.

Editors and Affiliations

  • Institut für Informatik, Universität zu Köln,  

    Michael Jünger

  • Fakultät für Mathematik, Otto-von-Guericke Universität Magdeburg, Magdeburg, Germany

    Volker Kaibel

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation