G
George L. Nemhauser
Researcher at Georgia Institute of Technology
Publications - 263
Citations - 44124
George L. Nemhauser is an academic researcher from Georgia Institute of Technology. The author has contributed to research in topics: Integer programming & Linear programming. The author has an hindex of 76, co-authored 260 publications receiving 41591 citations. Previous affiliations of George L. Nemhauser include Catholic University of Leuven & Cornell University.
Papers
More filters
Book
Integer and Combinatorial Optimization
TL;DR: This chapter discusses the Scope of Integer and Combinatorial Optimization, as well as applications of Special-Purpose Algorithms and Matching.
Book
Integer programming
TL;DR: The principles of integer programming are directed toward finding solutions to problems from the fields of economic planning, engineering design, and combinatorial optimization as mentioned in this paper, which is a standard of graduate-level courses since 1972.
Journal ArticleDOI
An analysis of approximations for maximizing submodular set functions--I
TL;DR: It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm.
Posted Content
An analysis of approximations for maximizing submodular set functions II
TL;DR: In this article, the authors considered the problem of finding a maximum weight independent set in a matroid, where the elements of the matroid are colored and the items of the independent set can have no more than K colors.
Journal ArticleDOI
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Cynthia Barnhart,Ellis L. Johnson,George L. Nemhauser,Martin W. P. Savelsbergh,Pamela H. Vance +4 more
TL;DR: In this paper, column generation methods for integer programs with a huge number of variables are discussed, including implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branch-and-bound tree.