Narrow search
Showing 1 - 8 of 8
Cover Image
Some properties of the fleet assignment problem
Gu, Z.; Johnson, E.L.; Nemhauser, G.L.; Wang, Y. - In: Operations research letters 15 (1994) 2, pp. 59-72
Persistent link: https://www.econbiz.de/10006867737
Cover Image
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
Nemhauser, G.L.; Vance, P.H. - In: Operations research letters 16 (1994) 5, pp. 255-264
Persistent link: https://www.econbiz.de/10006867680
Cover Image
One-machine generalized precedence constrained scheduling problems
Wikum, E.D.; Llewellyn, D.C.; Nemhauser, G.L. - In: Operations research letters 16 (1994) 2, pp. 87-100
Persistent link: https://www.econbiz.de/10006867698
Cover Image
MINTO, a Mixed INTeger Optimizer
Nemhauser, G.L.; Savelsbergh, M.W.P.; Sigismondi, G.C. - In: Operations research letters 15 (1994) 1, pp. 47
Persistent link: https://www.econbiz.de/10006867738
Cover Image
Experiments with parallel branch-and-bound algorithms for the set covering problem
Rushmeier, R.A.; Nemhauser, G.L. - In: Operations research letters 13 (1993) 5, pp. 277-286
Persistent link: https://www.econbiz.de/10006870351
Cover Image
A family of inequalities for the generalized assignment polytope
de Farias, I.R.; Nemhauser, G.L. - In: Operations research letters 29 (2001) 2, pp. 49-56
Persistent link: https://www.econbiz.de/10006831492
Cover Image
The complexity of cover inequality separation
Klabjan, D.; Nemhauser, G.L.; Tovey, C. - In: Operations research letters 23 (1998) 1, pp. 35-40
Persistent link: https://www.econbiz.de/10006845395
Cover Image
Mixed integer linear programming formulations for probabilistic constraints
Vielma, J.P.; Ahmed, S.; Nemhauser, G.L. - In: Operations research letters 40 (2012) 3, pp. 153-159
Persistent link: https://www.econbiz.de/10009848583