| 1996 | A Heuristic Algorithm for the Set Covering Problem. Alberto Caprara, Matteo Fischetti, Paolo Toth |
| 1996 | A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young |
| 1996 | A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. Paul Martin, David B. Shmoys |
| 1996 | A Polyhedral Approach to the Feedback Vertex Set Problem. Meinrad Funke, Gerhard Reinelt |
| 1996 | A Semidefinite Bound for Mixing Rates of Markov Chains. Nabil Kahalé |
| 1996 | A Submodular Optimization Problem with Side Constraints. David Hartvigsen |
| 1996 | A Supermodular Relaxation for Scheduling with Release Dates. Michel X. Goemans |
| 1996 | A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems. Paul Tseng, Dimitri P. Bertsekas |
| 1996 | Algorithms and Extended Formulations for One and Two Facility Network Design. Sunil Chopra, Itzhak Gilboa, S. Trilochan Sastry |
| 1996 | An Optimal, Stable Continued Fraction Algorithm. Carsten Rössner, Claus-Peter Schnorr |
| 1996 | Approximating Magnús M. Halldórsson |
| 1996 | Coloring Bipartite Hypergraphs. Hui Chen, Alan M. Frieze |
| 1996 | Colourful Linear Programming. Imre Bárány, Shmuel Onn |
| 1996 | Cone-LP's and Semidefinite Programs: Geometry. Gábor Pataki |
| 1996 | Continuous Relaxations for Constrained Maximum-Entropy Sampling. Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams |
| 1996 | Convexity and Steinitz's Exchange Property. Kazuo Murota |
| 1996 | Finding Real-Valued Single-Source Shortest Paths. Stavros G. Kolliopoulos, Clifford Stein |
| 1996 | Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems. Neil Simonetti, Egon Balas |
| 1996 | Improved Randomized Approximation Algorithms for Lot-Sizing Problems. Chung-Piaw Teo, Dimitris Bertsimas |
| 1996 | Integer Muticommodity Flow Problems. Cynthia Barnhart, Christopher A. Hane, Pamela H. Vance |
| 1996 | Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings William H. Cunningham, S. Thomas McCormick, Maurice Queyranne |
| 1996 | Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases. Han Hoogeveen, Tsuyoshi Kawaguchi |
| 1996 | On Dependent Randomized Rounding Algorithms. Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra |
| 1996 | On Ideal Clutters, Metrics and Multiflows. Beth Novick, András Sebö |
| 1996 | On Minimum 3-Cuts and Approximating Sanjiv Kapoor |
| 1996 | On Optimizing Multiplications of Sparse Matrices. Edith Cohen |
| 1996 | Optimal On-Line Algorithms for Single-Machine Scheduling. Han Hoogeveen, Arjen P. A. Vestjens |
| 1996 | Primal-Dual Approximation Algorithms for Feedback Problems. Michel X. Goemans, David P. Williamson |
| 1996 | Quadratic Knapsack Relaxations Using Cutting Planes. Christoph Helmberg, Franz Rendl, Robert Weismantel |
| 1996 | Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds. Andreas S. Schulz |
| 1996 | Separating Maximally Violated Comb Inequalities in Planar Graphs. Lisa Fleischer, Éva Tardos |
| 1996 | Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynominal Time. Robert Carr |
| 1996 | Test Sets and Inequalities for Integer Programs. Rekha R. Thomas, Robert Weismantel |
| 1996 | The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases. Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger |
| 1996 | The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown. Michel X. Goemans, Leslie A. Hall |
| 1996 | The Travelling Salesman and the PQ-Tree. Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger |
| 1996 | Transitive Packing. Rudolf Müller, Andreas S. Schulz |