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]
@inproceedings{FariasN02,
title = {A Polyhedral Study of the Cardinality Constrained Knapsack Problem},
author = {Ismael R. de Farias Jr. and George L. Nemhauser},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2337/23370291.htm},
researchr = {https://researchr.org/publication/FariasN02},
cites = {0},
citedby = {0},
pages = {291-303},
booktitle = {Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings},
editor = {William Cook and Andreas S. Schulz},
volume = {2337},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-43676-6},
}