George L. Nemhauser - Concepedia

Author

George L. Nemhauser

Also Known As

G L Nemhauser, G. L. NEMHAUSER, G. L. Nemhauser, G. Nemhauser, G.L Nemhauser, G.L. Nemhauser, GEORGE L. NEMHAUSER, George L Nemhauser, George L. Nemhauser, George Nemhauser

311

Publications

35.8K

Citations

H-Index

168

Concepts

All Affiliations

Georgia Institute of Technology Cornell University Johns Hopkins University ExxonMobil (United States)

About

George L. Nemhauser is an author at Georgia Institute of Technology specializing in engineering, combinatorial optimization, and mathematical programming.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	60	145	21.2K
2	Business	34	52	6.4K
3	Education	7	7	396
4	Natural Sciences	2	2	75
5	Management	1	1	10

George L. Nemhauser

161

Publications

28.3K

Citations

H-Index

Page 1

	Year	Citations
Integer and Combinatorial Optimization H. P. Williams, George L. Nemhauser, Laurence A. Wolsey Journal of the Operational Research Society	1990	5.5K
An analysis of approximations for maximizing submodular set functions—I George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher Mathematical Programming EngineeringOptimization ProblemCombinatorial OptimizationApproximation TheorySubmodular Set Functions—i	1978	4.4K
Branch-and-Price: Column Generation for Solving Huge Integer Programs Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser, Operations Research Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringTighter Lp RelaxationsComputational Complexity	1998	2.2K
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms Gérard Cornuéjols, Marshall L. Fisher, George L. Nemhauser Management Science Mathematical ProgrammingExceptional Paper—locationEngineeringComputational ComplexityApproximate Algorithms	1977	798
A Model and an Algorithm for the Dynamic Traffic Assignment Problems Deepak K. Merchant, George L. Nemhauser Transportation Science Mathematical ProgrammingTraffic TheoryEngineeringTraffic FlowDynamic Resource Allocation	1978	622
Best Algorithms for Approximating the Maximum of a Submodular Set Function George L. Nemhauser, Laurence A. Wolsey Mathematics of Operations Research Z SubmodularEngineeringComputational ComplexityDiscrete OptimizationExtremal Combinatorics	1978	545
The uncapacitated facility location problem Gérard Cornuéjols, George L. Nemhauser, L.A. Wolsey Mathematical ProgrammingSupply Chain OptimizationFacility PlanningEngineeringIndustrial Engineering	1990	482
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study Bram Verweij, Shabbir Ahmed, Anton J. Kleywegt, Computational Optimization and Applications	2003	473
Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms” Gérard Cornuéjols, Marshall L. Fisher, George L. Nemhauser Management Science Mathematical ProgrammingEngineeringBank AccountsApproximate AlgorithmsDiscrete Optimization	1979	437
The fleet assignment problem: Solving a large-scale integer program Christopher A. Hane, Cynthia Barnhart, Ellis L. Johnson, Mathematical Programming Mathematical ProgrammingEngineeringInteger OptimizationFleet Assignment ProblemCombinatorial Problem	1995	416

Page 1