| 2005 | Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem. | Prabhakar Gubbala, Balaji Raghavachari |
| 2005 | Sequential Pairing of Mixed Integer Inequalities. | Yongpei Guan, Shabbir Ahmed, George L. Nemhauser |
| 2005 | Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times. | Alexander Grigoriev, Maxim Sviridenko, Marc Uetz |
| 2005 | Unique Sink Orientations of Grids. | Bernd Grtner, Walter D. Morris Jr., Leo Rst |
| 2005 | On the L | Harold N. Gabow |
| 2005 | Mixed-Integer Cuts from Cyclic Groups. | Matteo Fischetti, Cristiano Saturni |
| 2005 | Optimizing over the First Chvtal Closure. | Matteo Fischetti, Andrea Lodi |
| 2005 | Approximate Min-max Relations for Odd Cycles in Planar Graphs. | Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta |
| 2005 | Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. | Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura |
| 2005 | On Two-Stage Stochastic Minimum Spanning Trees. | Kedar Dhamdhere, R. Ravi, Mohit Singh |
| 2005 | LP-Based Online Scheduling: From Single to Parallel Machines. | Jos R. Correa, Michael R. Wagner |
| 2005 | On the Inefficiency of Equilibria in Congestion Games. | Jos R. Correa, Andreas S. Schulz, Nicols E. Stier Moses |
| 2005 | A Study of Domino-Parity and k-Parity Constraints for the TSP. | William J. Cook, Daniel G. Espinoza, Marcos Goycoolea |
| 2005 | Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems. | Fabin A. Chudak, Vnia Eleutrio |
| 2005 | Bidimensional Packing by Bilinear Programming. | Alberto Caprara, Marco Locatelli, Michele Monaci |
| 2005 | On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem. | Andreas Brandstdt, Chnh T. Hong |
| 2005 | Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems. | Agustn Bompadre, James B. Orlin |
| 2005 | On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem. | Andreas Bley |
| 2005 | Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem. | Edoardo Amaldi, Pietro Belotti, Raphael Hauser |
| 2004 | A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract). | Jiawei Zhang, Bo Chen, Yinyu Ye |
| 2004 | Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption. | Jens Vygen |
| 2004 | The Path-Packing Structure of Graphs. | Andrs Seb, Lszl Szeg |
| 2004 | Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems. | R. Ravi, Amitabh Sinha |
| 2004 | The Price of Anarchy when Costs Are Non-separable and Asymmetric. | Georgia Perakis |
| 2004 | A TDI Description of Restricted 2-Matching Polytopes. | Gyula Pap |