Skip to main content
  • Conference proceedings
  • © 2004

Integer Programming and Combinatorial Optimization

10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings

Conference proceedings info: IPCO 2004.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (32 papers)

  1. Front Matter

  2. Session 1

    1. Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

      • Ricardo Fukasawa, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo Reis, Eduardo Uchoa, Renato F. Werneck
      Pages 1-15
    2. Metric Inequalities and the Network Loading Problem

      • Pasquale Avella, Sara Mattia, Antonio Sassano
      Pages 16-32
    3. Valid Inequalities Based on Simple Mixed-Integer Sets

      • Sanjeeb Dash, Oktay Günlük
      Pages 33-45
  3. Session 3

    1. A Robust Optimization Approach to Supply Chain Management

      • Dimitris Bertsimas, Aurélie Thiele
      Pages 86-100
    2. Scheduling an Industrial Production Facility

      • Eyjolfur Asgeirsson, Jonathan Berry, Cynthia A. Phillips, David J. Phillips, Cliff Stein, Joel Wein
      Pages 116-131
  4. Session 4

    1. Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs

      • Stéphane Bessy, Stéphan Thomassé
      Pages 132-138
    2. Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems

      • E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan
      Pages 152-162
  5. Session 5

    1. Semi-continuous Cuts for Mixed-Integer Programming

      • I. R. de Farias Jr.
      Pages 163-177
    2. Combinatorial Benders’ Cuts

      • Gianni Codato, Matteo Fischetti
      Pages 178-195
    3. A Faster Exact Separation Algorithm for Blossom Inequalities

      • Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis
      Pages 196-205
  6. Session 6

    1. LP-based Approximation Algorithms for Capacitated Facility Location

      • Retsef Levi, David B. Shmoys, Chaitanya Swamy
      Pages 206-218
  7. Session 7

    1. Three Kinds of Integer Programming Algorithms Based on Barvinok’s Rational Functions

      • J. A. De Loera, D. Haws, R. Hemmecke, P. Huggins, R. Yoshida
      Pages 244-255

Other Volumes

  1. Integer Programming and Combinatorial Optimization

Keywords

  • algorithms
  • approximation
  • combinatorial optimization
  • combinatorics
  • complexity
  • computational complexity
  • computational geometry
  • game theory
  • graph algorithms
  • integer programming
  • mathematical programming
  • network algorithms
  • optimization
  • programming
  • scheduling
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Department of IEOR, Columbia University, New York, NY, USA

    Daniel Bienstock

  • H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, USA

    George Nemhauser

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions