G. L. Nemhauser - Concepedia

Author

G. L. Nemhauser

Cornell University

Also Known As

G. L. Nemhauser, G. Nemhauser, G.L. NEMHAUSER, G.L. Nemhauser

Publications

7.1K

Citations

H-Index

Concepts

All Affiliations

Cornell University Yale University University of Rochester Georgia Institute of Technology

About

G. L. Nemhauser is an author at Cornell University specializing in engineering, combinatorial optimization, and discrete mathematics.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	10	10	1.9K
2	Computer Science	4	4	507
3	Business	2	2	124
4	Social Sciences	1	1	296
5	Economics	1	1	90

G. L. Nemhauser

Publications

2.6K

Citations

H-Index

Page 1

	Year	Citations
An analysis of approximations for maximizing submodular set functions - 1 Marshall L. Fisher, G. L. Nemhauser, Laurence A. Wolsey RePEc: Research Papers in Economics Mathematical ProgrammingEngineeringOptimization ProblemSubmodular Set FunctionsExtremal Set Theory	1978	840
Vertex packings: Structural properties and algorithms G. L. Nemhauser, L. E. Trotter Mathematical Programming Vertex PackingsGraph TheoryStructural Graph TheoryCombinatorial ProblemDiscrete Mathematics	1975	664
Properties of vertex packing and independence system polyhedra G. L. Nemhauser, L. E. Trotter Mathematical Programming Discrete GeometryEngineeringGraph TheoryPlanar GraphComputer-aided Design	1974	356
Optimal Political Districting by Implicit Enumeration Techniques Robert Garfinkel, G. L. Nemhauser Management Science Population UnitEngineeringComputational Social ChoiceSocial SciencesOperations Research	1970	296
The Set-Partitioning Problem: Set Covering with Equality Constraints Robert Garfinkel, G. L. Nemhauser Operations Research Mathematical ProgrammingSet-partitioning ProblemEnumerative AlgorithmEngineeringConstraint Satisfaction	1969	177
When the Greedy Solution Solves a Class of Knapsack Problems Michael J. Magazine, G. L. Nemhauser, L. E. Trotter Operations Research Mathematical ProgrammingEngineeringGame TheoryDiscrete OptimizationMarket Design	1975	90
Optimization theory for large systems G. L. Nemhauser IEEE Transactions on Automatic Control Large-scale Global OptimizationEngineeringContinuous OptimizationOptimization TheorySystem Optimization	1972	75
Facets of the Complementarity Knapsack Polytope I.R. de Farias, E. L. Johnson, G. L. Nemhauser Mathematics of Operations Research Mathematical ProgrammingEngineeringComplementarity ConstraintsConstrained OptimizationBranch And Cut	2002	39
A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case Andrew J. Miller, G. L. Nemhauser, Martin Savelsbergh Mathematical Programming Production PlanningIndustrial DesignEngineeringSetup TimesDesign	2003	34
A finiteness proof for modified dantzig cuts in integer programming V. Joseph Bowman, G. L. Nemhauser Naval Research Logistics Quarterly Mathematical ProgrammingEngineeringComputational ComplexityBranch And CutBasic Solution	1970	22

Page 1