• E. Balas, An Additive Algorithm for Solving Linear Programs with Zero-One Variables, Operations Research 13 (1965), 517.
• E. Balas, S. Ceria, and G. Cornuéjols, A Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs, Mathematical Programming 58 (1993), 295.
• E. Balas, S. Ceria, and G. Cornuéjols, Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework, Management Science 42 (1996), 1229.
• E. Balas, S. Ceria, G. Cornuéjols, and N. Natraj, Gomory Cuts Revisited, Operations Research Letters 19 (1996), 1.
• C. Barnhart, E. Johnson, G. Nemhauser, M. Savelsbergh, and P. Vance, Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research 46 (1998), 316.
• E. Beale, Branch and Bound Methods for Mathematical Programming Systems, Annals of Discrete Mathematics 5 (1979), 201.
• J. Benders, Partitioning Procedures for Solving Mixed-Variables Programming Problems, Numerische Mathematik 4 (1962), 238.
• V. Chvátal, Edmonds Polytopes and a Hierarchy of Combinatorial Problems, Discrete Mathematics 4 (1973), 305.
• W. Cook, T. Rutherford, H. Scarf, and D. Shallcross, An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming, ORSA Journal on Computing 5 (1993), 206.
• H. Crowder, E. Johnson, and M. Padberg, Solving Large-Scale Zero-One Linear Programming Problems, Operations Research 31 (1983), 803.
• R. Dakin, A Tree-Search Algorithm for Mixed Integer Programming Problems, The Computer Journal 8 (1964), 250.
• G. Dantzig, R. Fulkerson, and S. Johnson, Solution of a Large-Scale Traveling-Salesman Problem, Operations Research 2 (1954), 393.
• G. Dantzig and P. Wolfe, Decomposition Principle for Linear Programs, Operations Research 8 (1960), 101.
• J. Desrosiers, F. Soumis, and M. Desrochers, Routing with Time Windows by Column Generation, Operations Research 8 (1960), 101.
• J. Edmonds, Matroids and the Greedy Algorithm, Mathematical Programming 1 (1971), 127.
• J. Edmonds, Paths, Trees, and FLowers, Canadian Journal of Mathematics 17 (1965), 449.
• H. Everett, Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources, Operations Research 11 (1963), 399.
• M. Fisher, The Lagrangian Relaxation Method for Solving Integer Programming Problems, Management Science 27 (1981), 1.
• L. Ford and D. Fulkerson, Maximal Flow Through a Network, Canadian Journal of Mathematics 8 (1956), 399.
• A. Geoffrion, Lagrangean Relaxation for Integer Programming, Mathematical Programming Study 2 (1974), 82.
• A. Geoffrion and R. Marsten, Integer Programming Algorithms: A Framework and State-of-the-Art Survey, Management Science 18 (1972), 465.
• P. Gilmore and R. Gomory, A Linear Programming Approach to the Cutting- Stock Problem, Operations Research 9 (1961), 849.
• P. Gilmore and R. Gomory, A Linear Programming Approach to the Cutting- Stock Problem -- Part II, Operations Research 11 (1963), 863.
• P. Gilmore and R. Gomory, The Theory and Computation of Knapsack Functions, Operations Research 14 (1966), 1045.
• F. Glover, Surrogate Constraints, Operations Research 16 (1968), 741.
• M. Goemans, The Steiner Tree Polytope and Related Polyhedra, Mathematical Programming 63 (1994), 157.
• R. Gomory, Outline of an Algorithm for Integer Solutions to Linear Programs, Bulletin of the American Mathematical Society 64 (1958), 275.
• R. Gomory and T. Hu, Multi-Terminal Network Flows, SIAM Journal of Applied Mathematics 9 (1961), 551.
• R. Gomory and E. Johnson, Some Continuous Functions Related to Corner Polyhedra, Mathematical Programming 3 (1972), 23.
• M. Grötschel, L. Lovász, and A. Schrijver, The Ellipsoid Method and its Consequences in Combinatorial Optimization, Combinatorica 1 (1981), 169.
• M. Grötschel, L. Lovász, and A. Schrijver, Corrigendum to our Paper "The Ellipsoid Method and its Consequences in Combinatorial Optimization", Combinatorica 4 (1984), 291.
• M. Grötschel and W. Padberg, Partial Linear Characterizations of the Asymmetric Travelling Salesman Polytope, Mathematical Programming 8 (1975), 378.
• M. Guignard and K Spielberg, Logical Reduction Methods in Zero-One Programming, Operations Research 29 (1981), 49.
• M. Held and R. Karp, The Traveling-Salesman Problem and Minimum Spanning Trees, Operations Research 18 (1970), 1138.
• M. Held and R. Karp, The Traveling-Salesman Problem and Minimum Spanning Trees: Part II, Mathematical Programming 1 (1971), 6.
• K. Hoffman and M. Padberg, Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut, ORSA Journal on Computing 3 (1991), 121.
• M. Jünger, G. Reinelt, and S. Thienel, Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 20 (1995), 111.
• J. Kruskal, On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, Proceedings of the Americal Mathematical Society 7 (1956), 48.
• A. Land and A. Doig, An Automatic Method of Solving Discrete Programming Problems, Econometrica 28 (1960), 497.
• H. Lenstra, Integer Programming with a Fixed Number of Variables, Mathematics of Operations Research 8 (1983), 538.
• J. Linderoth and M. Savelsbergh, A Computational Study of Search Strategies for Mixed Integer Programming, Report LEC-97-12, Georgia Institute of Technology (1997).
• J. Little, K. Murty, D. Sweeney, and C. Karel, An Algorithm for the Traveling Salesman Problem, Operations Research 11 (1963), 972.
• L. Lovász and A. Schrijver, Cones of Matrices and Set-Functions and 0-1 Optimization, SIAM Journal on Optimization 1 (1991), 166.
• G. Nemhauser and L. Trotter, Properaties of Vertex Packing and Independence System Polyhedra, Mathematical Programming 6 (1974), 48.
• M. Padberg and G. Rinaldi, A Branch-and-Cut Algorithm for the Resolution of Large=Scale Symmetric Traveling Salesman Problems, SIAM Review 33 (1991), 60.
• M. Padberg, T. Van Roy, and L. Wolsey, Valid Linear Inequalities for Fixed Charge Problems, Operations Research 33 (1985), 842.
• C. Papadimitriou and M. Yannakakis, The Complexity of Facets (and Some Facets of Complexity), Journal of Computer and System Sciences 28 (1984), 244.
• M. Savelsbergh, A Branch-and-Price Algorithm for the Generalized Assignment Problem, Operations Research 45 (1997), 831.
• M. Savelsbergh, Preprocessing and Probing Techniques for Mixed Integer Programming Problems, ORSA Journal on Computing 6 (1994), 445.
• H. Sherali and W. Adams, A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems, SIAM Journal on Discrete Mathematics 3 (1990), 411.
• R. Weismantel, On the 0/1 Knapsack Polytope, Mathematical Programming 77 (1997), 49.
• L. Wolsey, Faces for a Linear Inequality in 0-1 Variables, Mathematical Programming 8 (1975), 165.
• L. Wolsey, Facets and Strong Valid Inequalities for Integer Programs, Operations Research 24 (1976), 367.

Last updated July 12, 2002