| 2002 | An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. | Alberto Caprara, Andrea Lodi, Michele Monaci |
| 2002 | Improved Approximation Algorithms for Resource Allocation. | Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani |
| 2002 | A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. | Mao-cheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu |
| 2002 | Finding the Exact Integrality Gap for Small Traveling Salesman Problems. | Sylvia C. Boyd, Genevive Labont |
| 2002 | The Distribution of Values in the Quadratic Assignment Problem. | Alexander I. Barvinok, Tamon Stephen |
| 2002 | Split Closure and Intersection Cuts. | Kent Andersen, Grard Cornujols, Yanjun Li |
| 2002 | A Polyhedral Approach to Surface Reconstruction from Planar Contours. | Ernst Althaus, Christian Fink |
| 2002 | On a Lemma of Scarf. | Ron Aharoni, Tams Fleiner |
| 2002 | Hard Equality Constrained Integer Knapsacks. | Karen I. Aardal, Arjen K. Lenstra |
| 2001 | Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. | Clifford Stein, David P. Wagner |
| 2001 | Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines. | Ren Sitters |
| 2001 | Connected Joins in Graphs. | Andrs Seb, Eric Tannier |
| 2001 | Performance Guarantees of Local Search for Multiprocessor Scheduling. | Petra Schuurman, Tjark Vredeveld |
| 2001 | A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. | Maurice Queyranne, Maxim Sviridenko |
| 2001 | Generating Cuts from Multiple-Term Disjunctions. | Michael Perregaard, Egon Balas |
| 2001 | Fences Are Futile: On Relaxations for the Linear Ordering Problem. | Alantha Newman, Santosh S. Vempala |
| 2001 | Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times. | Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh |
| 2001 | Pruning by Isomorphism in Branch-and-Cut. | Franois Margot |
| 2001 | An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs. | Jean B. Lasserre |
| 2001 | The Throughput of Sequential Testing. | Murali S. Kodialam |
| 2001 | Independence Free Graphs and Vertex Connectivity Augmentation. | Bill Jackson, Tibor Jordn |
| 2001 | Cutting Planes for Mixed 0-1 Semidefinite Programs. | Garud Iyengar, Mehmet Tolga ezik |
| 2001 | Bounds for Deterministic Periodic Routing Sequences. | Arie Hordijk, D. A. van der Laan |
| 2001 | Synthesis of 2-Commodity Flow Networks. | Refael Hassin, Asaf Levin |
| 2001 | A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. | Eran Halperin, Uri Zwick |