| 1993 | On the (integral) maximum tw flow in vertex and edge capacitated planar graphs. | Frieda Granot, Michal Penn |
| 1993 | An efficient implementation of a scaling minimum-cost flow algorithm. | Andrew V. Goldberg |
| 1993 | A new \frac34-approximation algorithm for MAX SAT. | Michel X. Goemans, David P. Williamson |
| 1993 | A polyhedron with all s-t cuts as vertices, and adjacency of cuts. | Naveen Garg, Vijay V. Vazirani |
| 1993 | Cycles of prescribed modularity in planar digraphs. | Anna Galluccio, Martin Loebl |
| 1993 | An efficient approximation algorithm for the survivable network design problem. | Harold N. Gabow, Michel X. Goemans, David P. Williamson |
| 1993 | Dynamic algorithms for optimization problems in bounded tree-width graphs. | Robert F. Cohen, Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter |
| 1993 | Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. | Jean-Maurice Clochard, Denis Naddef |
| 1993 | Solving integer programs with Fenchel cutting planes and preprocessing. | E. Andrew Boyd |
| 1993 | Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems. | Dimitris Bertsimas, Jos Nio-Mora |
| 1993 | The complex of maximal lattice free simplices. | Imre Brny, Roger Howe, Herbert E. Scarf |
| 1993 | On the monotonization of polyhedra. | Egon Balas, Matteo Fischetti |
| 1993 | On a characterization of the minimum assignment and matching in the independent random model. | Florin Avram, Dimitris Bertsimas |
| 1992 | A Polynomial Time Dual Algorithm for the Euclidean Multifacility Location Problem. | Guoliang Xue, J. Ben Rosen, Panos M. Pardalos |
| 1992 | Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry. | Farhad Shahrokhi, Lszl A. Szkely |
| 1992 | Forcing Colorations and the Strong Perfect Graph Conjecture. | Andrs Seb |
| 1992 | Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems. | Yves Pochet, Laurence A. Wolsey |
| 1992 | A Separation Routine for the Set Covering Polytope. | Paolo Nobili, Antonio Sassano |
| 1992 | An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines. | Silvano Martello, Franois Soumis, Paolo Toth |
| 1992 | The Metric Polytope. | Monique Laurent, Svatopluk Poljak |
| 1992 | Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling. | Jean B. Lasserre, Maurice Queyranne |
| 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 | Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. | Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano |
| 1992 | Nasty TSP Instances for Farthest Insertion. | Cor A. J. Hurkens |
| 1992 | New Lower and Upper Bounds for Scheduling Around a Small Common Due Date. | J. A. Hoogeveen, H. Oosterhout, Steef L. van de Velde |