| 2001 | A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. Maurice Queyranne, Maxim Sviridenko |
| 2001 | A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity. Lisa Fleischer |
| 2001 | A Matroid Generalization of the Stable Matching Polytope. Tamás Fleiner |
| 2001 | A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. Eran Halperin, Uri Zwick |
| 2001 | An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs. Jean B. Lasserre |
| 2001 | An Extension of a Theorem of Henneberg and Laman. András Frank, László Szegö |
| 2001 | Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation. Fabián A. Chudak, Tim Roughgarden, David P. Williamson |
| 2001 | Approximating k-Spanner Problems for k>2. Michael Elkin, David Peleg |
| 2001 | Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. Clifford Stein, David P. Wagner |
| 2001 | Bisubmodular Function Minimization. Satoru Fujishige, Satoru Iwata |
| 2001 | Bounds for Deterministic Periodic Routing Sequences. Arie Hordijk, D. A. van der Laan |
| 2001 | Circuit Mengerian Directed Graphs. Bertrand Guenin |
| 2001 | Combined Connectivity Augmentation and Orientation Problems. András Frank, Tamás Király |
| 2001 | Connected Joins in Graphs. András Sebö, Eric Tannier |
| 2001 | Cutting Planes for Mixed 0-1 Semidefinite Programs. Garud Iyengar, Mehmet Tolga Çezik |
| 2001 | Edge Covers of Setpairs and the Iterative Rounding Method. Joseph Cheriyan, 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 | Fast 2-Variable Integer Programming. Friedrich Eisenbrand, Günter Rote |
| 2001 | Fences Are Futile: On Relaxations for the Linear Ordering Problem. Alantha Newman, Santosh S. Vempala |
| 2001 | Generating Cuts from Multiple-Term Disjunctions. Michael Perregaard, Egon Balas |
| 2001 | Independence Free Graphs and Vertex Connectivity Augmentation. Bill Jackson, Tibor Jordán |
| 2001 | Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings Karen I. Aardal, Bert Gerards |
| 2001 | Integral Polyhedra Related to Even Cycle and Even Cut Matroids. Bertrand Guenin |
| 2001 | On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem. Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, Amitabh Sinha II |
| 2001 | On the Rank of Mixed 0, 1 Polyhedra. Gérard Cornuéjols, Yanjun Li |
| 2001 | Performance Guarantees of Local Search for Multiprocessor Scheduling. Petra Schuurman, Tjark Vredeveld |
| 2001 | Pruning by Isomorphism in Branch-and-Cut. François Margot |
| 2001 | Strongly Polynomial Algorithms for the Unsplittable Flow Problem. Yossi Azar, Oded Regev |
| 2001 | Synthesis of 2-Commodity Flow Networks. Refael Hassin, Asaf Levin |
| 2001 | The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates. Cheng-Feng Mabel Chou, Maurice Queyranne, David Simchi-Levi |
| 2001 | The Throughput of Sequential Testing. Murali S. Kodialam |
| 2001 | Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines. René Sitters |
| 2001 | Two O (log Aaron Archer |