10. IPCO 2004: New York, NY, USA

• Ricardo Fukasawa, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo Reis, Eduardo Uchoa, Renato Fonseca F. Werneck:
  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. 1-15
  
• Pasquale Avella, Sara Mattia, Antonio Sassano:
  Metric Inequalities and the Network Loading Problem. 16-32
  
• Sanjeeb Dash, Oktay Günlük:
  Valid Inequalities Based on Simple Mixed-Integer Sets. 33-45
  
• G. Perakis:
  The Price of Anarchy when Costs Are Non-separable and Asymmetric. 46-58
  
• José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses:
  Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract. 59-73
  
• Dmitrii Lozovanu:
  Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games. 74-85
  
• Dimitris Bertsimas, Aurélie Thiele:
  A Robust Optimization Approach to Supply Chain Management. 86-100
  
• R. Ravi, Amitabh Sinha:
  Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems. 101-115
  
• Eyjolfur Asgeirsson, Jonathan W. Berry, Cynthia A. Phillips, David J. Phillips, Clifford Stein, Joel Wein:
  Scheduling an Industrial Production Facility. 116-131
  
• Stéphane Bessy, Stéphan Thomassé:
  Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs. 132-138
  
• Gyula Pap:
  A TDI Description of Restricted 2-Matching Polytopes. 139-151
  
• Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
  Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. 152-162
  
• I. R. de Farias:
  Semi-continuous Cuts for Mixed-Integer Programming. 163-177
  
• Gianni Codato, Matteo Fischetti:
  Combinatorial Benders' Cuts. 178-195
  
• Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis:
  A Faster Exact Separation Algorithm for Blossom Inequalities. 196-205
  
• Retsef Levi, David B. Shmoys, Chaitanya Swamy:
  LP-based Approximation Algorithms for Capacitated Facility Location. 206-218
  
• Jiawei Zhang, Bo Chen, Yinyu Ye:
  A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract). 219-233
  
• Thomas L. Magnanti, Dan Stratila:
  Separable Concave Optimization Approximately Equals Piecewise Linear Optimization. 234-243
  
• Jesús A. De Loera, David Haws, Raymond Hemmecke, Peter Huggins, Ruriko Yoshida:
  Three Kinds of Integer Programming Algorithms Based on Barvinok's Rational Functions. 244-255
  
• András Sebö, László Szegö:
  The Path-Packing Structure of Graphs. 256-270
  
• Jon Lee, François Margot:
  More on a Binary-Encoded Coloring Formulation. 271-282
  
• José R. Correa, Andreas S. Schulz:
  Single Machine Scheduling with Precedence Constraints: Extended Abstract. 283-297
  
• Asaf Levin, Gerhard J. Woeginger:
  The Constrained Minimum Weighted Sum of Job Completion Times Problem. 298-307
  
• Jens Vygen:
  Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption. 308-324
  
• Kevin Lang, Satish Rao:
  A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts. 325-337
  
• Jesús A. De Loera, Shmuel Onn:
  All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables. 338-351
  
• Satoru Iwata, Satoko Moriguchi, Kazuo Murota:
  A Capacity Scaling Algorithm for M-convex Submodular Flow. 352-367
  
• Alexander V. Karzanov:
  Integer Concave Cocirculations and Honeycombs. 368-387
  
• Nicola Apollonio, András Sebö:
  Minsquare Factors and Maxfix Covers of Graphs. 388-400
  
• Volker Kaibel:
  Low-Dimensional Faces of Random 0/1-Polytopes. 401-415
  
• Tamás Király, Márton Makai:
  On Polyhedra Related to Even Factors. 416-430
  
• Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi:
  Optimizing over Semimetric Polytopes. 431-443