Nemhauser, G. L.

An analysis of approximations for maximizing submodular set functions—I

Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978) · Mathematical Programming

Complexity and Algorithms in GraphsOptimization and Search Problems

Cited by 4,412

Branch-and-price: column generation for solving huge integer programs

Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research

Advanced Optimization Algorithms ResearchComplexity and Algorithms in Graphs

Cited by 2,219

Best Algorithms for Approximating the Maximum of a Submodular Set Function

Nemhauser, G. L., & Wolsey, L. A. (1978) · Mathematics of Operations Research

Complexity and Algorithms in GraphsGame Theory and Voting Systems

Cited by 538