A Polyhedral Study of the Cardinality Constrained Knapsack Problem

Ismael R. de Farias Jr., George L. Nemhauser. A Polyhedral Study of the Cardinality Constrained Knapsack Problem. In William Cook, Andreas S. Schulz, editors, Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings. Volume 2337 of Lecture Notes in Computer Science, pages 291-303, Springer, 2002. [doi]

Authors

Ismael R. de Farias Jr.

This author has not been identified. Look up 'Ismael R. de Farias Jr.' in Google

George L. Nemhauser

This author has not been identified. Look up 'George L. Nemhauser' in Google