Some facets for an assignment problem with side constraintsRONNY ABOUDI; NEMHAUSER, G. L.Operations research. 1991, Vol 39, Num 2, pp 244-250, issn 0030-364XArticle

Computational experience with a polynomial-time dual simplex algorithm for the transportation problemIKURA, Y; NEMHAUSER, G. L.Discrete applied mathematics. 1986, Vol 13, Num 2-3, pp 239-248, issn 0166-218XArticle

Simplex pivots on the set packing polytopeIKURA, Y; NEMHAUSER, G. L.Mathematical programming. 1985, Vol 33, Num 2, pp 123-138, issn 0025-5610Article

A polynomial algorithm for the max-cut problem on graphs without Long Odd cyclesGRÖTSCHEL, M; NEMHAUSER, G. L.Mathematical programming. 1984, Vol 29, Num 1, pp 28-40, issn 0025-5610Article

Polyhedral characterizations and perfection of line graphsCAO, D; NEMHAUSER, G. L.Discrete applied mathematics. 1998, Vol 81, Num 1-3, pp 141-154, issn 0166-218XArticle

A polyhedral study of the cardinality constrained knapsack problemDE FARIAS, I. R; NEMHAUSER, G. L.Mathematical programming. 2003, Vol 96, Num 3, pp 439-467, issn 0025-5610, 29 p.Article

Lifted flow cover inequalities for mixed 0-1 integer programsZONGHAOGU; NEMHAUSER, G. L; SAVELSBERGH, M. W. P et al.Mathematical programming. 1999, Vol 85, Num 3, pp 439-467, issn 0025-5610Article

An optimization based heuristic for political districtingMEHROTRA, A; JOHNSON, E. L; NEMHAUSER, G. L et al.Management science. 1998, Vol 44, Num 8, pp 1100-1114, issn 0025-1909Article

Covering, packing and generalized perfectionCHANG, G. J; NEMHAUSER, G. L.SIAM journal on algebraic and discrete methods. 1985, Vol 6, Num 1, pp 109-132, issn 0196-5212Article

Recent developments and future directions in mathematical programmingJOHNSON, E. L; NEMHAUSER, G. L.Yugoslav journal of operations research. 1992, Vol 2, Num 2, pp 143-162, issn 0354-0243Article

A recursive procedure to generate all cuts for 0-1 mixed integer programsNEMHAUSER, G. L; WOLSEY, L. A.Mathematical programming. 1990, Vol 46, Num 3, pp 379-390, issn 0025-5610Article

The K-domination and K-stability problems of sun-free chordal graphsCHANG, G. J; NEMHAUSER, G. L.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 3, pp 332-345, issn 0196-5212Article

Scheduling a major college basketball conferenceNEMHAUSER, G. L; TRICK, M. A.Operations research. 1998, Vol 46, Num 1, pp 1-8, issn 0030-364XArticle

Recent developments and future directions in mathematical programmingJOHNSON, E. L; NEMHAUSER, G. L.IBM systems journal. 1992, Vol 31, Num 1, pp 79-93, issn 0018-8670Article

A generalized assignment problem with special ordered sets: a polyhedral approachDE FARIAS, I. R; JOHNSON, E. L; NEMHAUSER, G. L et al.Mathematical programming. 2000, Vol 89, Num 1, pp 187-203, issn 0025-5610Article

One-machine generalized precedence constrained scheduling problemsWIKUM, E. D; LLEWELLYN, D. C; NEMHAUSER, G. L et al.Operations research letters. 1994, Vol 16, Num 2, pp 87-99, issn 0167-6377Article

Branch-and-bound and parallel computation: a historical notePRUUL, E. A; NEMHAUSER, G. L; RUSHMEIER, R. A et al.Operations research letters. 1988, Vol 7, Num 2, pp 65-69, issn 0167-6377Article

Valid inequalities for problems with additive variable upper boundsATAMTÜRK, A; NEMHAUSER, G. L; SAVELSBERGH, M. W. P et al.Lecture notes in computer science. 1999, pp 60-72, issn 0302-9743, isbn 3-540-66019-4Conference Paper

Airline crew scheduling : A new formulation and decomposition algorithmVANCE, P. H; BARNHART, C; JOHNSON, E. L et al.Operations research. 1997, Vol 45, Num 2, pp 188-200, issn 0030-364XArticle

Formulating a mixed integer programming problem to improve solvabilityBARNHART, C; JOHNSON, E. L; NEMHAUSER, G. L et al.Operations research. 1993, Vol 41, Num 6, pp 1013-1019, issn 0030-364XArticle

The fleet assignment problem : solving a large-scale integer programHANE, C. A; BARNHART, C; JOHNSON, E. L et al.Mathematical programming. 1995, Vol 70, Num 2, pp 211-232, issn 0025-5610Article

Per-Seat, On-Demand Air Transportation Part I. Problem Description and an Integer Multicommodity Flow ModelESPINOZA, D; GARCIA, R; GOYCOOLEA, M et al.Transportation science. 2008, Vol 42, Num 3, pp 263-278, issn 0041-1655, 16 p.Article

Lifted inequalities for 0-1 mixed integer programming: Superlinear liftingRICHARD, J.-P. P; DE FARIAS, I. R; NEMHAUSER, G. L et al.Mathematical programming. 2003, Vol 98, Num 1-3, pp 115-143, issn 0025-5610, 29 p.Conference Paper

A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special caseMILLER, A. J; NEMHAUSER, G. L; SAVELSBERGH, M. W. P et al.Mathematical programming. 2003, Vol 95, Num 1, pp 71-90, issn 0025-5610, 20 p.Conference Paper

Branch-and-price : Column generation for solving huge integer programsBARNHART, C; JOHNSON, E. L; NEMHAUSER, G. L et al.Operations research. 1998, Vol 46, Num 3, pp 316-329, issn 0030-364XArticle