| 1992 | Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality. | Dorit S. Hochbaum, Joseph Naor |
| 1992 | An Exact Characterization of Greedy Structures. | Paul Helman, Bernard M. E. Moret, Henry D. Shapiro |
| 1992 | Mixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem. | Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Arago |
| 1992 | Fast Parallel Algorithms for Bipartite Matching. | Lov K. Grover |
| 1992 | Polyhedral Description of Trees and Arborescences. | Michel X. Goemans |
| 1992 | When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? | Alan M. Frieze, Richard M. Karp, Bruce A. Reed |
| 1992 | On Multiflow Problems. | Andrs Frank, Alexander V. Karzanov, Andrs Seb |
| 1992 | Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope. | Matteo Fischetti |
| 1992 | Algorithms and Min-max Theorems for Certain Multiway Cuts. | Pter L. Erds, Lszl A. Szkely |
| 1992 | Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex Algorithm. | Martin E. Dyer, Alan M. Frieze |
| 1992 | Recognition and Representation of Proper Circular Arc Graphs. | Xiaotie Deng, Pavol Hell, Jing Huang |
| 1992 | Subgraph Degree-Sequence Polyhedra. | William H. Cunningham, Fan Zhang |
| 1992 | The K-Edge Connected Spanning Subgraph Polyhedron. | Sunil Chopra |
| 1992 | A Complexity Index for Satisfiability Problems. | Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks |
| 1992 | A Lot-Sizing Problem on Trees, Related to Network Design. | Daniel Bienstock |
| 1992 | Extended Polymatroids: Properties and Optimization. | Partha P. Bhattacharya, Leonidas Georgiadis, Pantelis Tsoucas |
| 1992 | A Technique for Speeding up the Solution of the Lagrangian Dual. | Dimitris Bertsimas, James B. Orlin |
| 1992 | Optimization Problems on Matroids and Exponential Sums. | Alexander I. Barvinok |
| 1992 | On 2-Connected Subgraph Polytopes. | Francisco Barahona, Ali Ridha Mahjoub |
| 1992 | Combinatorial Optimization with Semi-Definite Matrices. | Farid Alizadeh |
| 1992 | A Criterion of Polynomial-Time Solvability for the Network Location Problem. | Alexander A. Ageev |
| 1990 | Dual Decomposition of Single Machine Scheduling Problems. | Steef L. van de Velde |
| 1990 | A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\surdVE) General Graph Matching Algorithm. | Vijay V. Vazirani |
| 1990 | Scheduling Multiple Variable-Speed Machines. | Michael A. Trick |
| 1990 | Integer Solution to Synthesis of Communication Networks. | S. Sridhar, R. Chandrasekaran |