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