G. L. Nemhauser

Engineering · Physical Sciences

17h-index7.1kcitations25works0.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Optimization and Packing Problems(9), Optimization and Search Problems(7), Scheduling and Optimization Algorithms(6), Vehicle Routing Optimization Methods(6), Advanced Graph Theory Research(5)

Publications25 total

Handbook Of Discrete Optimization
Data Archiving and Networked Services (DANS)·2005· 20 cited
A multi-exchange local search algorithm for the capacitated facility location problem - (Extended abstract)
2004
A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
Mathematical Programming·2003· 34 cited
Facets of the Complementarity Knapsack Polytope
Mathematics of Operations Research·2002· 39 cited
A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
Journal of the Operational Research Society·1992· 3 cited
A Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times
Combinatorial optimization·1992· 23 cited
An analysis of approximations for maximizing submodular set functions - 1
RePEc: Research Papers in Economics·1978· 840 cited
An analysis of approximations for maximizing submodular set functions—II
Mathematical programming studies·1978· 559 cited
Best algorithms for approximating the maximum of a submodular set function
LIDAM Reprints CORE·1978· 5 cited
The Traveling Salesman Problem: A Survey
Lecture notes in economics and mathematical systems·1976· 369 cited
Vertex packings: Structural properties and algorithms
Mathematical Programming·1975· 664 cited
When the Greedy Solution Solves a Class of Knapsack Problems
Operations Research·1975· 90 cited
Properties of vertex packing and independence system polyhedra
Mathematical Programming·1974· 356 cited
Set Partitioning and Chain Decomposition
Management Science·1974· 12 cited
Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems
Mathematical programming studies·1974· 107 cited
A Survey of Integer Programming Emphasizing Computation and Relations among Models
Mathematical Programming·1973· 21 cited
Optimization theory for large systems
IEEE Transactions on Automatic Control·1972· 75 cited
Integer programming
RePEc: Research Papers in Economics·1972· 3.4k cited
A finiteness proof for modified dantzig cuts in integer programming
Naval Research Logistics Quarterly·1970· 22 cited
Optimal Political Districting by Implicit Enumeration Techniques
Management Science·1970· 296 cited
page 1 of 2Next →

Frequent Co-authors

L. E. Trotter(5), Laurence A. Wolsey(4), Robert Garfinkel(4), Marshall L. Fisher(2), Martin Savelsbergh(2), Mandell Bellmore(1), D. R. Fulkerson(1), Michael J. Magazine(1), I.R. de Farias(1), E. L. Johnson(1), Andrew J. Miller(1), V. Joseph Bowman(1), Karen Aardal(1), Robert Weismantel(1), Charles S. Beightler(1), L. G. Mitten(1), Robert M. Nauss(1), G. Sigismondi(1), Daniel Bienstock(1)