| 1992 | A Complexity Index for Satisfiability Problems. Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks |
| 1992 | A Criterion of Polynomial-Time Solvability for the Network Location Problem. Alexander A. Ageev |
| 1992 | A Lot-Sizing Problem on Trees, Related to Network Design. Daniel Bienstock |
| 1992 | A Polynomial Time Dual Algorithm for the Euclidean Multifacility Location Problem. Guoliang Xue, J. Ben Rosen, Panos M. Pardalos |
| 1992 | A Separation Routine for the Set Covering Polytope. Paolo Nobili, Antonio Sassano |
| 1992 | A Technique for Speeding up the Solution of the Lagrangian Dual. Dimitris Bertsimas, James B. Orlin |
| 1992 | Algorithms and Min-max Theorems for Certain Multiway Cuts. Péter L. Erdös, László A. Székely |
| 1992 | An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines. Silvano Martello, François Soumis, Paolo Toth |
| 1992 | An Exact Characterization of Greedy Structures. Paul Helman, Bernard M. E. Moret, Henry D. Shapiro |
| 1992 | An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems. Narendra Karmarkar, S. A. Thakur |
| 1992 | Combinatorial Optimization with Semi-Definite Matrices. Farid Alizadeh |
| 1992 | Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry. Farhad Shahrokhi, László A. Székely |
| 1992 | Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano |
| 1992 | Extended Polymatroids: Properties and Optimization. Partha P. Bhattacharya, Leonidas Georgiadis, Pantelis Tsoucas |
| 1992 | Fast Parallel Algorithms for Bipartite Matching. Lov K. Grover |
| 1992 | Forcing Colorations and the Strong Perfect Graph Conjecture. András Sebö |
| 1992 | Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling. Jean B. Lasserre, Maurice Queyranne |
| 1992 | Mixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem. Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão |
| 1992 | Nasty TSP Instances for Farthest Insertion. Cor A. J. Hurkens |
| 1992 | Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems. Yves Pochet, Laurence A. Wolsey |
| 1992 | New Lower and Upper Bounds for Scheduling Around a Small Common Due Date. J. A. Hoogeveen, H. Oosterhout, Steef L. van de Velde |
| 1992 | On 2-Connected Subgraph Polytopes. Francisco Barahona, Ali Ridha Mahjoub |
| 1992 | On Multiflow Problems. András Frank, Alexander V. Karzanov, András Sebö |
| 1992 | Optimization Problems on Matroids and Exponential Sums. Alexander I. Barvinok |
| 1992 | Polyhedral Description of Trees and Arborescences. Michel X. Goemans |
| 1992 | Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, May 1992 Egon Balas, Gérard Cornuéjols, Ravi Kannan |
| 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 | Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality. Dorit S. Hochbaum, Joseph Naor |
| 1992 | Subgraph Degree-Sequence Polyhedra. William H. Cunningham, Fan Zhang |
| 1992 | The K-Edge Connected Spanning Subgraph Polyhedron. Sunil Chopra |
| 1992 | The Metric Polytope. Monique Laurent, Svatopluk Poljak |
| 1992 | Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope. Matteo Fischetti |
| 1992 | When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? Alan M. Frieze, Richard M. Karp, Bruce A. Reed |