| 1999 | A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts. Hiroshi Nagamochi, Toshihide Ibaraki |
| 1999 | A Min-Max Theorem on Feedback Vertex Sets. Mao-cheng Cai, Xiaotie Deng, Wenan Zang |
| 1999 | A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. Satoru Iwata, S. Thomas McCormick, Maiko Shigeno |
| 1999 | An Introduction to Empty Lattice Simplices. András Sebö |
| 1999 | An Orientation Theorem with Parity Conditions. András Frank, Tibor Jordán, Zoltán Szigeti |
| 1999 | Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. Eran Halperin, Uri Zwick |
| 1999 | Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts. Alexander A. Ageev, Maxim Sviridenko |
| 1999 | Approximation Algorithms for a Directed Network Design Problem. Vardges Melkonian, Éva Tardos |
| 1999 | Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. Friedrich Eisenbrand, Andreas S. Schulz |
| 1999 | Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope. Jean Fonlupt, Ali Ridha Mahjoub |
| 1999 | Edge-Splitting Problems with Demands. Tibor Jordán |
| 1999 | Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow. Stavros G. Kolliopoulos, Clifford Stein |
| 1999 | Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications. Chung-Piaw Teo, Jay Sethuraman, Wee-Peng Tan |
| 1999 | Improved Approximation Algorithms for Capacitated Facility Location Problems. Fabián A. Chudak, David P. Williamson |
| 1999 | Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings Gérard Cornuéjols, Rainer E. Burkard, Gerhard J. Woeginger |
| 1999 | Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors. Kenji Kashiwabara, Masataka Nakamura, Takashi Takabatake |
| 1999 | Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances. Karen I. Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink |
| 1999 | On Optimal Ear-Decompositions of Graphs. Zoltán Szigeti |
| 1999 | On the Chvátal Rank of Certain Inequalities. Mark E. Hartmann, Maurice Queyranne, Yaoguang Wang |
| 1999 | On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms. Philip N. Klein, Neal E. Young |
| 1999 | On the Separation of Maximally Violated mod-k Cuts. Alberto Caprara, Matteo Fischetti, Adam N. Letchford |
| 1999 | Optimal 3-Terminal Cuts and Linear Programming. William H. Cunningham, Lawrence Tang |
| 1999 | Optimal Compaction of Orthogonal Grid Drawings. Gunnar W. Klau, Petra Mutzel |
| 1999 | Optimizing over All Combinatorial Embeddings of a Planar Graph. Petra Mutzel, René Weiskircher |
| 1999 | Parity Constrained András Frank, Zoltán Király |
| 1999 | Scheduling Two Machines with Release Times. John Noga, Steven S. Seiden |
| 1999 | Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem. Dragos M. Cvetkovic, Mirjana Cangalovic, Vera Kovacevic-Vujcic |
| 1999 | Solving the Convex Cost Integer Dual Network Flow Problem. Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin |
| 1999 | Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem. Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr. |
| 1999 | The Square-Free 2-Factor Problem in Bipartite Graphs. David Hartvigsen |
| 1999 | The m-Cost ATSP. Christoph Helmberg |
| 1999 | Universally Maximum Flow with Piecewise-Constant Capacities. Lisa Fleischer |
| 1999 | Valid Inequalities for Problems with Additive Variable Upper Bounds. Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh |
| 1999 | Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut. Eduardo Uchoa, Marcus Poggi de Aragão |