Jump to Content: Welcome to the virtual world of Georgia Tech

School of Industrial and Systems Engineering at Georgia Tech
 
Faculty Webpage

George Nemhauser Website

crumb trail: GT >> College of Engineering >> School of Industrial and Systems Engineering >> ISyE Personal Web Site

Publications

Books

  • Introduction to Dynamic Programming, Wiley, 1966
  • Integer Programming, Wiley, 1972, (with R.S. Garfinkel)
  • Studies in Integer Programming, North-Holland, 1977 (co-edited with P.L. Hammer, E.L. Johnson and B. Korte)
  • Integer and Combinatorial Optimization, Wiley, 1988, (with L.A. Wolsey) (Recipient of Lanchester Prize, 1990)
  • Optimization: Volume 1 of Handbooks in Operations Research and Management Science, 1989 (co-edited with A.H.G. Rinnooy Kan and M.J. Todd)
  • Network Models: Volume 7 of Handbooks in Operations Research and Management Science, 1995 (co-edited with M.O. Ball, T.L. Magnanti, and C.L. Monma)
  • Network Routing: Volume 8 of Handbooks in Operations Research and Management Science, 1995 (co-edited with M.O. Ball, T.L. Magnanti, and C.L. Monma)

Articles

  • "A Short Table of Z-Transforms and Generating Functions," Operations Research 9, 575-578 (1961), (with C. Beightler and L. G. Mitten).
  • "On the Relation Between the Traveling-Saleman and the Longest-Path Problems," Operations Research 10, 647-657 (1962), (with W.W. Hardgrave).
  • "Multistage Optimization," Chemical Engineering Progress 59, 52-60 (1963), (with L.G. Mitten).
  • "Applications of Dynamic Programming in the Process Industries," American Institute of Industrial Engineers Proceedings, 279-298 (1963).
  • "Thinned Unequally Spaced Arrays Designed by Dynamic Programming," PGATP Symposium, 224-227 (1963), (with M. Skolnik, I. Kefauver and J. Sherman).
  • "Optimize Multistage Processes with Dynamic Programming," Chemical Engineering, 70, 195-200 (1963), (with L. G. Mitten).
  • "A Geometric Model and a Graphical Algorithm for a Sequencing Problem," Operations Research 11, 889-900 (1963), (with W.W. Hardgrave).
  • "Dynamic Programming Applied to Unequally Spaced Arrays," Institute of Electrical and Electronic Engineers Transactions on Antennas and Propogation, AP-12, 34-43 (1964), (with M. Skolnik and J. Sherman).
  • "Optimization of Multistage Cycle and Branching Systems by Serial Procedures," Journal of American Institute of Chemical Engineers 10, 913-919 (1964), (with R. Aris and D.J. Wilde).
  • "An Algorithm for the Line Balancing Problem," Management Science 11, 308-315 (1964), (with A. Gutjahr).
  • "Decomposition of Linear Programs by Dynamic Programming," Naval Research Logistics Quarterly 11, 191-195 (1964).
  • "A Quantitative Approach to Employment Planning," Management Science 11, B-155-B-165 (1965), (with H. Nuttle).
  • "Scheduling to Minimize Interaction Cost," Operations Research 14, 15-23 (1966), (with R.C. Carlson).
  • "A Note on Lot Sizes and Safety Stock Level," Journal of Industrial Engineering XVII, 389-390 (1966).
  • "Multicycle Project Planning," Journal of Industrial Engineering XVIII, 278-284 (1967), (with A.C. Fisher).
  • A Note on Capital Budgeting," Journal of Industrial Engineering XVIII, 375-376 (1967).
  • "A Transport Improvement Problem Transformable to a Best Path Problem," Transportation Science 1, 295-307 (1967), (with A.J. Goldman).
  • "A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem," Operations Research 16, 450-453 (1968), (with Z. Ullmann).
  • "The Traveling Salesman Problem: A Survey," Operations Research 16, 538-558 (1968), (with M. Bellmore).
  • "Minimizing Round-Off Errors", Journal of Industrial Engineering XIX, 306-308 (1968).
  • "Computer Construction of Project Networks," Communications of the Association of Computing Machinery 11, 493-497 (1968), (with A.C. Fisher and J.S. Liebman).
  • "Optimal Capacity Expansion," Naval Research Logistics Quarterly 15, 531-550 (1968), (with G.T. Howard).
  • "Computational Results for a Stopping Rule Problem on Averages," Naval Research Logistics Quarterly 15, 567-578 (1968), (with D. Pierce).
  • "Discrete Dynamic Programming and Capital Allocation," Management Science 15, 494-505 (1969), (with Z. Ullmann).
  • "Scheduling Local and Express Service," Transportation Science 3, 164-175 (1969).
  • "The Set Partitioning Problem: Set Covering Problem with Equality Constraints," Operations Research 17, 848-856 (1969), (with R.S. Garfinkel).
  • "A Decomposable Transshipment Algorithm for a Multiperiod Transportation Problem," Naval Research Logistics Quarterly 16, 517-524 (1969), (with M. Bellmore and D. Eklof).
  • "Optimal Political Districting by Implicit Enumeration Techniques," Management Science 16, 495-508 (1970), (with R.S. Garfinkel).
  • "A Finiteness Proof for Modified Dantzig Cuts in Integer Programming," Naval Research Logistics Quarterly 17, 309-314 (1970), (with V. J. Bowman).
  • "A Modified Linear Program for Columnar Methods in Mathematical Programming," Operations Research 19, 1051-1060 (1971), (with W. Widhelm).
  • "Deep Cuts in Integer Programming," Opsearch 8, 89-111 (1972), (with V.J. Bowman).
  • "Bulk Service Scheduling," Operations Research 20, 813-819 (1972), (with P.L. Yu).
  • "Optimal Set Covering: A Survey," in Perspectives on Optimization, A. Geoffrion (ed)., 164-193, Addison-Wesley, (1972), (with R.S. Garfinkel).
  • "A Generalized Permanent Label Setting Algorithm for the Shortest Path Between Specified Nodes," Journal of Mathematical Analysis and Applications 38, 328-334 (1972).
  • "Temporal Expansion of a Transportation Network - I," Transportation Science 6, 306-323 (1972), (with S.C. Frey, Jr).
  • "Temporal Expansion of a Transportation Network - II," Transportation Science 6, 395-406 (1972), (with S.C. Frey, Jr).
  • "A Column Generation Algorithm for Optimal Traffic Assignment," Transportation Science 7, 168-176 (1973), (with T. Leventhal and L. E. Trotter, Jr.).
  • "A Survey of Integer Programming Emphasizing Computation and Relations Among Models," in Mathematical Programming, T.C. Hu and S. M. Robinson (eds.), 77-155, Academic Press, (1973), (with R.S. Garfinkel).
  • "Properties of Vertex Packing and Independence System Polyhedra," Mathematical Programming 6, 48-61 (1974), (with L.E. Trotter, Jr.).
  • "Set Partitioning and Chain Decomposition," Management Science 20, 1413-1423 (1974), (with L.E. Trotter, Jr. and R.M. Nauss).
  • "Some Inequalities on the Chromatic Number of a Graph," Discrete Mathematics 10, 117-121 (1974), (with T.King).
  • "Two Computationally Difficult Set Covering Problems That Arise in Computing the 1-Width of Incidence Matrices of Steiner Triple Systems," Mathematical Programming Studies 2, 72-81 (1974), (with D.R. Fulkerson and L. E. Trotter, Jr.).
  • "When the Greedy Solution Solves a Class of Knapsack Problems," Operations Research 23, 207-217 (1975), (with M.J. Magazine and L.E. Trotter, Jr.).
  • "Vertex Packings: Structural Properties and Algorithms," Mathematical Programming 8, 232-248 (1975), (with L.E. Trotter, Jr.).
  • "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms," Management Science 23, 789-810 (1977), (with G. Cornuejols and M. L. Fisher) -- published as an exceptional paper and recipient of Lanchester Prize.
  • "On the Uncapacitated Location Problem," Annals of Discrete Mathematics, 1, 163-178 (1977), (with G. Cornuejols and M.L. Fisher).
  • "A Model and an Algorithm for the Dynamic Traffic Assignment Problem," Transportation Science 12, 183-199 (1978), (with D. Merchant).
  • "Optimality Conditions for a Dynamic Traffic Assignment Model," Transportation Science 12, 200-207 (1978), (with D. Merchant).
  • "An Analysis of Approximations for Maximizing Submodular Set Functions-I," Mathematical Programming 14, 265-294 (1978), (with M.L. Fisher and L. A. Wolsey).
  • "An Analysis of Approximations for Maximizing Submodular Set Functions-II," Mathematical Programming Studies 8, 73-87 (1978), (with M.L. Fisher and L. A. Wolsey).
  • "Tight Bounds for Christofiedes Traveling Salesman Heuristic," Mathematical Programming 14, 116-121 (1978), (with G. Cornuejols).
  • "Best Algorithms for Maximizing a Submodular Function," Mathematics of Operations Research 3, 177-188 (1978), (with L.A. Wolsey).
  • "An Analysis of Approximations for Maximizing a Hamiltonian Circuit," Operations Research 27, 799-809 (1979), (with M.L. Fisher and L.A. Wolsey).
  • "Easy and Hard Bottleneck Location Problems," Discrete Applied Mathematics 1, 209-216 (1979), (with W.L. Hsu).
  • "Optimal Set Partitioning Matchings and Lagrangian Duality," Naval Research Logistics Quarterly 26, 553-563 (1979), (with G. Weber).
  • "Matroids and a Reliability Analysis Problem," Mathematics of Operations Research 4, 132-144 (1979), (with M. Ball).
  • "Worst Case and Probabilistic Analysis of Algorithms for a Location Problem," Operations Research 28, 847-888 (1980), (with G. Cornuejols and L.A. Wolsey).
  • "A Canonical Representation of Simple Plant Location Problems and its Applications," SIAM Journal on Algebraic and Discrete Methods 1, 261-272 (1980), (with G. Cornuejols and L.A. Wolsey).
  • "A Polynomial Algorithm for Maximum Weighted Vertex Packings on Graphs Without Long Odd Cycles," Mathematical Programming 20, 225-232 (1981), (with W.L. Hsu and Y. Ikura).
  • "Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms," Annals of Discrete Mathematics 11, 279-302 (1981), (with L.A. Wolsey).
  • "Algorithms for Minimum Covering by Cliques and Maximum Cliques in Claw-Free Perfect Graphs," Discrete Mathematics 37, 181-191 (1981), (with W.L. Hsu).
  • "An Application of Vertex Packing to Data Analysis in the Evaluation of Pavement Deterioration," Operations Research Letters 1, 13-17 (1981), (with E. Gattass).
  • "A Polynomial Algorithm for the Minimum Weighted Clique Cover Problem on Claw-Free Perfect Graphs," Discrete Mathematics 38, 65-71 (1982), (with W.L Hsu).
  • "An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs," Annals of Discrete Mathematics 16, 149-168 (1982), (with Y. Ikura).
  • "R-Domination on Block Graphs," Operations Research Letters 1, (1982), (with G. Chang).
  • "The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs." SIAM Journal on Algebraic and Discrete Methods 5, 332-345 (1984), (with G. Chang).
  • "A Polynomial Algorithm for the Max-Cut Problem on Graphs Without Long Odd Cycles," Mathematical Programming 29, 28-40 (1984), (with M. Grotschel).
  • "Algorithms for Maximum Weight Cliques, Minimum Weighted Clique Covers, and Minimum Colorings of Claw-Free Perfect Graphs," Annals of Discrete Mathematics 21, 373-385 (1984), (with W.L. Hsu).
  • "Covering, Packing, and Generalized Perfection," SIAM Journal on Algebraic and Discrete Methods 6, 109-132 (1985), (with G. Chang).
  • "Duality for Integer Optimization," pp.11-20 in Combinatorial Optimization: Annotated Bibliographies, M. O'hEigeartaigh, J.K. Lenstra, and A.H.G. Rinnooy Kan (eds.) Wiley, (1985).
  • "Simplex Pivots on the Set Packing Polytope," Mathematical Programming 33, 123-138 (1985), (with Y. Ikura).
  • "Computational Experience with a Polynomial-Time Dual Simplex Algorithm for the Transportation Problem," Discrete Applied Mathematics 13, 239-248 (1986), (with Y. Ikura).
  • "Branch-and-Bound and Parallel Computation: A Historical Note," Operations Research Letters 7, 65-69 (1988), (with E. Pruul and R. Rushmeier).
  • "Operations Research: The Next Decade," Operations Research 36, 619-637 (1988), (One of four principal authors of committee report).
  • "Integer Programming," pp. 447-528 in Optimization, Vol. 1 of Handbooks in OR, G.L. Nemhauser, A.H.G. Rinnooy Kan, and M.J. Todd, (eds), North-Holland, (1989), (with L.A. Wolsey).
  • "The Uncapacitated Facility Location Problem," pp. 119-172 in Discrete Location Theory, R.L. Francis and P. Mirchandini, (eds), Wiley (1990), (with G. Cornuejols and L.A. Wolsey).
  • "A Recursive Procedure to Generate All Cuts in Mixed-Integer Programs," Mathematical Programming 46, 379-390 (1990), (with L.A. Wolsey).
  • "An Assignment Problem with Side Constraints: Strong Cutting Planes and Separation," pp. 457-472 in Economic Decision Making: Games, Econometrics, and Optimization, J.J. Gabszewicz, J.F. Richard, and L.A. Wolsey, eds, North-Holland (1990), (with R. Aboudi).
  • "Some Facets for an Assignment Problem with Side Constraints," Operations Research 39, 244-250 (1991), (with R. Aboudi).
  • "A Polyhedral Approach to Edge Coloring," Operations Research Letters 10, 315-322 (1991), (with S. Park).
  • "Experiments with Parallel Branch-and-Bound Algorithms for the Set Covering Problem," Operations Research Letters 13, 277-286 (1992), (with R. Rushmeier).
  • "A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing," Journal of the Operations Research Society 43, 443-457 (1992), (with G. Sigismondi).
  • "Recent Developments and Future Directions in Mathematical Programming," IBM Systems Journal 31, 79-93 (1992), (with E.L. Johnson).
  • "A Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times," 63-82 in Combinatorial Optimization: New Frontiers in Theory and Practice," M. Akgul, H.W. Hamacher, and S. Tufekci, eds, Springer-Verlag (1992), (with M.W. Savelsbergh).
  • "Min-Cut Clustering," Mathematical Programming 62, 133-151 (1993), (with A. Mehrotra and E.L. Johnson).
  • "Formulating a Mixed-Integer Distribution Problem to Improve Solvability," Operations Research 41, 1013 -1019 (1993), (with C. Barnhart, E.L. Johnson, G. Sigismondi and P. Vance).
  • "The Age of Optimization: Solving Large-Scale Real World Problems," Operations Research 42, 5-13 (1994).
  • "Some Properties of the Fleet Assignment Problem," Operations Research Letters 15, 59-71(1994), (with Z. Gu, E.L. Johnson, and Y. Wang).
  • "Solving Binary Cutting Stock Problems by Column Generation and Branch-and- Bound," Computational Optimization and Applications 3, 111-130 (1994), (with P. Vance and C. Barnhart, E.L. Johnson).
  • "MINTO: A Mixed INTeger Optimizer," Operations Research Letters 15, 47-58 (1994), (with M. Savelsbergh and G. Sigismondi).
  • "One-Machine Generalized Precedence Constrained Scheduling Problems," Operations Research Letters 16, 87-99 (1994), (with E. Wikum and D. Llewellyn).
  • "Lifted Cover Facets of the 0-1 Knapsack Polytope with GUB Constraints,"Operations Research Letters 16, 255-263 (1994), (with P. Vance).
  • "The Fleet Assignment Problem: Solving a Large-scale Integer Program," Mathematical Programming 70, 211-232 (1995), (with C. Hane, C. Barnhart, E.L. Johnson, R. Marsten, and G. Sigismondi).
  • "A MINTO Short Cource," LEC95-05 Working Paper, (1995), (with M. Savelsbergh).
  • "Sequence Independent Lifting in Mixed Integer Programming," Journal of Computational Optimization 4, 109-103, (2000), (with Z. Gu and M. Savelsbergh).
  • "Maximizing a Submodular Function by Integer Programming: Part I - the Quadratic Case," European Journal of Operations Research 94, No. 1, 154-166, (1996), (with H. Lee and Y. Wang).
  • "Maintenance and Crew Consideration in the Fleet Assignment Problem," Transportation Science 30, No. 3, 249-260 (1996), (with L. Clarke, C. Hane and E. Johnson).
  • "A Combined Lagrangian, Linear Programming and Implication Heuristic for Large-Scale Set Partitioning Problems," Journal of Heuristics 1, 247-259 (1996), (with A. Atamturk and M. Savelsbergh).
  • "Finding an Optimal Stationing Policy for the US Army in Europe After the Force Drawdown," Military Operations Research, Vol. 2, No. 4 (1996), (with A. Loerch, N. Boland and E. Johnson).
  • "Lifted Flow Cover Inequalitites for Mixed 0-1 Integer Programs," Mathematical Programming 85, 439-467, (1999), (with Z. Gu and M. Savelsbergh).
  • "Dynamic Network Flow with Uncertain Arc Capacities: Formulation and Problem Structure," Operations Research 48, 233-242, (2000), (with G. Glockner).
  • "Production Scheduling in Almost Continuous Time" IIE Transactions 29, 391-398 (1997), (with K. Gue and M. Padron).
  • "Airline Crew Scheduling: A New Formulation and Decomposition," Operations Research 45, No. 2, 188-200 (1997) (with P. Vance, C. Barnhart, and E.L. Johnson).
  • "The Aircraft Rotation Problem," Annals of Operations Research 69, 33-46 (1997), (with L. Clarke, E. Johnson, and Z. Zhu).
  • "Progress in Linear Programming Based Algorithms for Integer Programming: An Exposition," INFORMS Journal on Computing 12, 2-23, (2000), (with E. Johnson and M. Savelsbergh).
  • "Dynamic Network Flow with Uncertain Arc Capacities: Decomposition Algorithm and Computational Results," LEC97-04 Working Paper to appear in Computational Optimization and Applications, (1997), (with G. Glockner and C. Tovey).
  • "Branch-and-Price: Column Generation for Solving Huge Integer Problems," Operations Research, 46, No. 3, May-June (1998), (with C. Barnhart, E.L. Johnson, M. Savelsbergh and P. Vance).
  • "Polyhedral Characterizations and Perfection of Line Graphs," Discrete Applied Mathematics 81, 141-154 (1998), (with D. Cao).
  • "Scheduling a Major College Basketball Conference," Operations Research 46, No. 1, 1-8, (1998), (with M. Trick).
  • "Cover Inequality Separation is NP-Hard," Operations Research Letters 23, 35-40, (1998), (with D. Klabjan and C.A. Tovey).
  • "An Optimization Based Heuristic for Political Districting," Management Science 44, No. 8, 1100-1114, (1998), (with A. Mehrotra and E. Johnson).
  • "Flight String Models for Aircraft Fleeting and Routing," Transportation Science 32, No. 3, 208-220, (1998), (with C. Barnhart, N. Boland, L. Clarke, E. Johnson, and R. Shenoi).
  • "The Asymmetric Traveling Salesman Problem with Replenishment Arcs," European Journal of Operations Research 123, 408-427, (2000), (with N. Boland and L. Clarke).
  • "Heuristic Optimization: A hybrid AI/OR approach," Proceedings of CP97: Constraint-directed Scheduling, (1997), (with Clements, Crawford, D. Joslin, M. Puttlitz, and M. Savelsbergh).
  • "A Generalized Assignment Problem with Special Ordered Sets: A Polyhedral Approach,"Mathematical Programming 89, 187-203, (2000), (with I. de Faris and E. Johnson).
  • "Conflict Graphs in Solving Integer Programming Problems," European Journal of Operations Research 121, 40-55, (2000), (with A. Atamturk and M. Savelsbergh).
  • "The Mixed Vertex Packing Problem,"Mathematical Programming 89, 35-54, (2000), (with A. Atamturk and M. Savelsbergh).
  • "Airline Crew Recovery," Transportation Science 34, 337-348, (2000), (with L. Lettovsky and E. Johnson).
  • "Facets of the Complementarity Knapsack Polytope," TLI/LEC98-08 Working Paper, (1998), (with I. de Farias and E. Johnson).
  • "Lifted Cover Inequalities for 0-1 Integer Programs I: Computation," INFORMS Journal of Computing 10, 427-437, (1998), (with Z. Gu and M.W.P. Savelsbergh).
  • "On the Capacitated Lot-Sizing and Continuous 0-1 Knapsack Polyhedra," European Journal of Operations Research 125, 298-315, (2000), (with A. Miller and M. Savelsbergh).
  • "Valid Inequalities for Problems with Additive Variable Upper Bounds," Extended Abstract Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, 60-72, (1999), to appear in Mathematical Programming, (with A. Atamturk and M. Savelsbergh).
  • "Lifted Cover Inequalities for 0-1 Integer Programs II: Complexity," INFORMS Journal on Computing 11, (1999), (with Z. Gu and M.W.P. Savelsbergh).
  • "Allocating Fibers in Cable Manufacturing," MSOM, 1, 21-35, (1999), (with D. Adelman, M. Padron, R. Pandit, and R. Stubbs).
  • "Price-Directed Control of Remnant Inventory Systems," Operations Research, 47, 889-898 (1999), (with D. Adelman).
  • "A Branch-and-Cut for Combinatorial Optimization Problems without Auxiliary Binary Variables," TLI/LEC-99-09 working paper, (1999), (with I. De Farias and E.L. Johnson).
  • "A Parallel Primal-Dual Simplex Algorithm," Operations Research Letters 27, 47-55, (2000), (with D. Klabjan and E.L. Johnson).
  • "Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching," TLI/LEC-99-11 working paper to appear in Computational Optimization and Applications, (1999), (with D. Klabjan and E.L. Johnson).
  • "Airline Crew Scheduling with Time Windows and Plane Count Constraints," TLI/LEC-99-12 working paper, (1999), (with D. Klabjan, E.L. Johnson, E. Gelman and S. Ramaswamy).
  • "Airline Crew Scheduling with Regularity," TLI/LEC-99-13 working paper to appear in Transportation Science, (1999), (with D. Klabjan and E.L. Johnson).
  • "A Family of Inequalities for the Generalized Assignment Polytope," TLI-00-01 working paper, (2000), (with I. de Farias).
  • "Solving Multi-Item Capacitated Lot-Sizing Problems with Setup Times by Branch-and-Cut," TLI-00-04 working paper, (2000), (with A. Miller and M. Savelsbergh).
  • "A Stochastic Model of Airline Operations," TLI-00-06 working paper, (2000), (with J. Rosenberger, A. Schaefer, D. Goldsman, E. Johnson and A. Kleywegt).
  • "On the Polyhedral Structure of a Multi-Item Production Planning Model with Setup Times," TLI-00-07 working paper, (2000), (with A. Miller and M. Savelsbergh).
  • "A Multi-Item Production Planning Model with Setup Times: Algorithms, Reformulations, and Polyhedral Characterizations for a Special Case," TLI-00-08 working paper, (2000), (with A. Miller and M. Savelsbergh).
  • "The Asymmetric Traveling Salesman Problem with Replenishment Arcs," European Journal of Operations Research 123, 408-427, (2000), (with N. Boland and L. Clarke).
  • "A Generalized Assignment Problem with Special Ordered Sets: A Polyhedral Approach,"Mathematical Programming 89, 187-203, (2000), (with I. de Faris and E. Johnson).
  • "Conflict Graphs in Solving Integer Programming Problems," European Journal of Operations Research 121, 40-55, (2000), (with A. Atamturk and M. Savelsbergh).
  • "The Mixed Vertex Packing Problem,"Mathematical Programming 89, 35-54, (2000), (with A. Atamturk and M. Savelsbergh).
  • "Airline Crew Recovery," Transportation Science 34, 337-348, (2000), (with L. Lettovsky and E. Johnson).
  • "On the Capacitated Lot-Sizing and Continuous 0-1 Knapsack Polyhedra," European Journal of Operations Research 125, 298-315, (2000), (with A. Miller and M. Savelsbergh).
  • "Dynamic Network Flow with Uncertain Arc Capacities: Formulation and Problem Structure," Operations Research 48, 233-242, (2000), (with G. Glockner).
  • "A Parallel Primal-Dual Simplex Algorithm," Operations Research Letters 27, 47-55, (2000), (with D. Klabjan and E.L. Johnson).
  • "Sequence Independent Lifting in Mixed Integer Programming," Journal of Computational Optimization 4, 109-103, (2000), (with Z. Gu and M. Savelsbergh).
  • "Progress in Linear Programming Based Algorithms for Integer Programming: An Exposition," INFORMS Journal on Computing 12, 2-23, (2000), (with E. Johnson and M. Savelsbergh).
  • "Dynamic Network Flow with Uncertain Arc Capacities: Decomposition Algorithm and Computational Results," Computational Optimization and Applications 18, 233-250, (2001), (with G. Glockner and C. Tovey).
  • "Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching," Computational Optimization and Applications 20, 73-91, (2001), (with D. Klabjan and E.L. Johnson).
  • "A Family of Inequalities for the Generalized Assignment Polytope," OR Letters 29, 49-55, (2001), (with I. de Farias).
  • "Valid Inequalities for Problems with Additive Variable Upper Bounds," Mathematical Programming 91, 145-162, (2001), (with A. Atamturk and M. Savelsbergh).
  • "A Branch-and-Cut for Combinatorial Optimization Problems without Auxiliary Binary Variables," The Knowledge Engineering Review 16, 25-39, (2001), (with I. De Farias and E.L. Johnson).
  • "Airline Crew Scheduling with Regularity," Transportation Science 35, 359-374 (2001), (with D. Klabjan, E.L. Johnson, E. Gelman and S. Ramaswamy).
  • "The Traveling Tournament Problem: Description and Benchmarks," Principals and Practice of Constraint Programming – CP 2001, Springer Lecture Notes in Computer Science 2239, 580-585, (2001), (with K. Easton and M.A. Trick).
  • "Facets of the Complementarity Knapsack Polytope," Mathematics of Operations Research 27, 210-226, (2002), (with I. de Farias and E. Johnson).
  • "Airline Crew Scheduling with Time Windows and Plane Count Constraints," Transportation Science 36, 337-348, (2002), (with D. Klabjan, E.L. Johnson, E. Gelman and S. Ramaswamy).
  • "A Stochastic Model of Airline Operations," Transportation Science 36, 357-377, (2002), (with J. Rosenberger, A. Schaefer, D. Goldsman, E. Johnson and A. Kleywegt).
  • "Crew Scheduling," Handbook of Transportation Science, 2nd Edition, R.W. Hall Ed., pp. 517-560, (2002), (with C. Barnhart, A.M. Cohn, E.L. Johnson, D. Klabjan, and P.H. Vance).
  • "A Polyhedral Study of Integer Variable Upper Bounds," Mathematics of Operations Research 27, 711-739, (2002), (with D. Klabjan).
  • "On the Polyhedral Structure of a Multi-Item Production Planning Model with Setup Times," Mathematical Programming 94, 375-405, (2003), (with A. Miller and M. Savelsbergh).
  •  "A Multi-Item Production Planning Model with Setup Times: Algorithms, Reformulations, and Polyhedral Characterizations for a Special Case," Mathematical Programming 95, 71-90, (2003), (with A. Miller and M. Savelsbergh).
  • "The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study," Computational Optimization and Applications 24, 289-333, (2003), (with B. Verweij, S. Ahmed, A. Kleywegt, and A. Shapiro).
  • "A Simplex Based Algorithm for 0-1 Mixed Integer Programming," Combinatorial Optimization-Eureka, You Shrink, M. Junger, G. Reinelt, G. Rinaldi (Eds.), Springer lecture notes in Computer Science 2570, (2003), (with J-P. Richard and I. de Farias).
  • "Rerouting Aircraft for Airline Recovery," Transportation Science 37, 408-421, (2003), (with J. Rosenberger and E. Johnson).
  • "A Polyhedral Study of the Cardinality Constrained Knapsack Problem," Mathematical Programming 96, 439-467, (2003), (with I. de Farias). (Also extended abstract in IPCO Proceedings, W. Cook and A. Schulz (eds.) Springer Lecture Notes in Computer Science 2337, 291-306, (2003).)
  • "Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms," Mathematical Programming 98, 89-113, (2003), (with Jean-Philippe Richard and Ismael de Farias).
  • "Lifted Inequalities for 0-1 Mixed Integer Programming: Superlinear Lifting," Mathematical Programming 98, 115-143, (2003), (with Jean-Philippe Richard and Ismael de Farias). (Also extended abstract in IPCO Proceedings, W. Cook and A. Schulz (eds.) Springer Lecture Notes in Computer Science 2337, 161-175, (2003).)
  • "Models for Representing Piecewise Linear Cost Functions," Operations Research Letters 32, 44-48, (2004), (with Ahmet Keha and Ismael de Farias).
  • "CP Based Branch-and-Price," Constraint and Integer Programming: Toward a United Methodology, M. Milano (ed.), pp. 207-232, Kluwer Academic Publishers, 2004.
  • "Sports Scheduling," Handbook of Scheduling, J. Y-T. Leung (ed.), 52-1 – 52-19. Chapman and Hall/CRC (2004), (with K. Easton and M. Trick).
  • "Solving the Traveling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach," E. Burke and P. Causmaeher (eds.), Springer Lecture notes in Computer Science 2740, 63-77, (2004), (with Kelly Easton and Michael Trick).
  • "A Robust Fleet Assignment Model with Hub Isolation and Short Cycles," Transportation Science 38, 357-368, (2004), (with J.M. Rosenberger and E.L. Johnson).
  • "Airline Crew Scheduling under Uncertainty," Transportation Science 39, 340-348, (2005). (with A. Schaefer, E. Johnson, and A. Kleywegt).
  • "A Polyhedral Study of Nonconvex Quadratic Programs with Box Constraints," Mathematical Programming 102, 531-557, (2005), (with Dieter Vandenbussche)
  • "A Branch-and-Cut Algorithm for Nonconvex Quadratic Programs with Box Constraint," Mathematical Programming 102, 559-575, (2005), (with Dieter Vandenbussche).
  • "The 2-Edge-Connected Subgraph Polyhedron," Journal of Combinatorial Optimization 9, 357-379, (2005), (with Dieter Vandenbussche).
GT website ISyE website GT CoE website