| 1990 | A Decomposition Theorem for Balanced Matrices. Michele Conforti, Gérard Cornuéjols |
| 1990 | A Genetic Algorithm for the Assembly Line Balancing Problem. Edward J. Anderson, Michael C. Ferris |
| 1990 | A Survey of Some Results in Discrete Optimisation. A. A. Fridman, Eugene Levner |
| 1990 | A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\surdVE) General Graph Matching Algorithm. Vijay V. Vazirani |
| 1990 | An Interior-Point Approach to NP-Complete Problems. Narendra Karmarkar |
| 1990 | Ancestor Tree for Arbitrary Multi-Terminal Cut Functions. Chung-Kuan Cheng, T. C. Hu |
| 1990 | Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques. Scott W. Hadley, Franz Rendl, Henry Wolkowicz |
| 1990 | Column Generation Methods for Probabilistic Logic. Brigitte Jaumard, Pierre Hansen, Marcus Poggi de Aragão |
| 1990 | Computational Experience with an Interior Point Algorithm on the Satisfiability Problem. Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende |
| 1990 | Conservative Weightings and Ear-Decompositions of Graphs. András Frank |
| 1990 | Dual Decomposition of Single Machine Scheduling Problems. Steef L. van de Velde |
| 1990 | Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge. Franz Aurenhammer, Johann Hagauer, Wilfried Imrich |
| 1990 | Finding Out Whether a Valid Inequality is Facet Defining. Egon Balas |
| 1990 | Flow in Planar Graphs with Vertex Capacities. Samir Khuller, Joseph Naor |
| 1990 | Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization. András Sebö |
| 1990 | Integer Solution to Synthesis of Communication Networks. S. Sridhar, R. Chandrasekaran |
| 1990 | Max-Balanced Flows. Michael H. Schneider, Mark E. Hartmann, Hans Schneider |
| 1990 | Minimizing Maximum Earliness and Maximum Lateness on a Single Machine. J. A. Hoogeveen |
| 1990 | Modular Arithmetic and Randomization for Exact Matroid Problems. Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli |
| 1990 | Near-Optimal Sequencing with Precedence Constraints. Leslie A. Hall, David B. Shmoys |
| 1990 | New Results on Facets of the Cut Cone. Michel Deza, Monique Laurent |
| 1990 | O(m\cdotn) Isomorphism Algorithms for Circular-Arc Graphs and Circle Graphs. Wen-Lian Hsu |
| 1990 | On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem. Norbert Ascheuer, Laureano F. Escudero, Martin Grötschel, Mechthild Stoer |
| 1990 | On the Clique-Rank and the Coloration of Perfect Graphs. Jean Fonlupt, András Sebö |
| 1990 | On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its Extensions. Dorit S. Hochbaum |
| 1990 | On the Radon Number of the Integer Lattice. Shmuel Onn |
| 1990 | Perfection, Parity, Planarity, and Packing Paths. Bruce A. Reed |
| 1990 | Polyhedral Results for the Precedence-Constrained Knapsack Problem. E. Andrew Boyd |
| 1990 | Polynomially Solvable Cases of the Simple Plant Location Problem. Alexander A. Ageev, Vladimir L. Beresnev |
| 1990 | Probabilistic Analysis of the Generalised Assignment Problem. Martin E. Dyer, Alan M. Frieze |
| 1990 | Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, Waterloo, Ontorio, Canada, May 28-30 1990 Ravi Kannan, William R. Pulleyblank |
| 1990 | Scheduling Multiple Variable-Speed Machines. Michael A. Trick |
| 1990 | Shellability of Oriented Matroids. Winfried Hochstättler |
| 1990 | Some Provably Hard Crossing Number Problems. Daniel Bienstock |
| 1990 | Stability Critical Graphs and Even Subdivisions of K_4. Edward C. Sewell, Leslie E. Trotter Jr. |
| 1990 | The Fastest Algorithm for the Pert Problem with AND-and OR-Nodes (The New-Product-New-Technology Problem). E. A. Dinic |
| 1990 | The Graphical Asymmetric Traveling Salesman Polyhedron. Sunil Chopra, Giovanni Rinaldi |
| 1990 | Vertex Disjoint Channel Routing on Two Layers. András Recski, Frank Strzyzewski |