[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Integer Programming and Combinatorial Optimization

13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings

  • Conference proceedings
  • © 2008

Overview

Editors:
  1. Andrea Lodi
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Alessandro Panconesi
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Giovanni Rinaldi
    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 5035)

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

Included in the following conference series:

Conference proceedings info: IPCO 2008.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
€32.70 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook EUR 42.79
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book EUR 52.74
Price includes VAT (France)
  • 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

About this book

The volume contains the papers selected for presentation at IPCO 2008, the 13th International Conference on Integer Programming and Combinatorial - timization that was held in Bertinoro (Italy), May 26–28, 2008. The IPCO series of conferences, sponsored by the Mathematical Progr- ming Society, highlights recent developments in theory, computation, and app- cation of integer programming and combinatorial optimization. The ?rst conf- ence took place in 1990; starting from IPCO 1995, the proceedings are published in the Lecture Notes in Computer Science series. The 12 previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995 [LNCS 920], Vancouver (Canada) 1996 [LNCS 1084], Houston (USA) 1998 [LNCS 1412], Graz (Austria) 1999 [LNCS 1610], Utrecht (The Netherlands) 2001 [LNCS 2081], Boston (USA) 2002 [LNCS 2337], New York (USA) 2004 [LNCS 2986], Berlin (Germany) 2005 [LNCS 3509], and Ithaca (USA) 2007 [LNCS 4168]. The c- ference is not held in the years when the International Symposium of the Ma- ematical Programming Society takes place.

Similar content being viewed by others

Keywords

Table of contents (32 papers)

  1. Front Matter

    Download chapter PDF

  2. Session 1

    1. Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables

      • Oktay Günlük, Jeff Linderoth
      Pages 1-16

    2. Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs

      • Anureet Saxena, Pierre Bonami, Jon Lee
      Pages 17-33

    3. The Air Traffic Flow Management Problem: An Integer Optimization Approach

      • Dimitris Bertsimas, Guglielmo Lulli, Amedeo Odoni
      Pages 34-46

  3. Session 2

    1. The Induced Disjoint Paths Problem

      • Ken-ichi Kawarabayashi, Yusuke Kobayashi
      Pages 47-61

    2. A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs

      • Kenjiro Takazawa
      Pages 62-76

    3. A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs

      • Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer
      Pages 77-96

    4. A Polynomial Algorithm for Weighted Abstract Flow

      • Maren Martens, S. Thomas McCormick
      Pages 97-111

  4. Session 3

    1. A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem

      • Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin
      Pages 112-124

    2. Binary Positive Semidefinite Matrices and Associated Integer Polytopes

      • Adam N. Letchford, Michael M. Sørensen
      Pages 125-139

    3. Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities

      • Konstantinos Georgiou, Avner Magen, Iannis Tourlakis
      Pages 140-153

  5. Session 4

    1. Tight Bounds for Permutation Flow Shop Scheduling

      • Viswanath Nagarajan, Maxim Sviridenko
      Pages 154-168

    2. The Stochastic Machine Replenishment Problem

      • Kamesh Munagala, Peng Shi
      Pages 169-183

    3. A Polynomial Time Approximation Scheme for the Square Packing Problem

      • Klaus Jansen, Roberto Solis-Oba
      Pages 184-198

  6. Session 5

    1. Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints

      • Juan Pablo Vielma, George L. Nemhauser
      Pages 199-213

    2. Computing with Multi-row Gomory Cuts

      • Daniel G. Espinoza
      Pages 214-224

    3. Constraint Orbital Branching

      • James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio
      Pages 225-239

  7. Session 6

    1. A Fast, Simpler Algorithm for the Matroid Parity Problem

      • James B. Orlin
      Pages 240-258

    2. Degree Bounded Matroids and Submodular Flows

      • Tamás Király, Lap Chi Lau, Mohit Singh
      Pages 259-272

    3. Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle

      • André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer
      Pages 273-287
Back to top

Other volumes

  1. Integer Programming and Combinatorial Optimization

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation