A polyhedral study of the cardinality constrained knapsack problem
Author
Abstract
Suggested Citation
DOI: 10.1007/s10107-003-0420-8
Note: In : Mathematical Programming Serie A, 96, 439-467, 2003
Download full text from publisher
To our knowledge, this item is not available for download. To find whether it is available, there are three options:1. Check below whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Elif Akçalı & Alper Üngör & Reha Uzsoy, 2005. "Short‐term capacity allocation problem with tool and setup constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(8), pages 754-764, December.
- F J Vasko & D D Newhart & A D Strauss, 2005. "Coal blending models for optimum cokemaking and blast furnace operation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 235-243, March.
- Christopher Hojny & Tristan Gally & Oliver Habeck & Hendrik Lüthen & Frederic Matter & Marc E. Pfetsch & Andreas Schmitt, 2020. "Knapsack polytopes: a survey," Annals of Operations Research, Springer, vol. 292(1), pages 469-517, September.
- Joey Huchette & Joey Huchette, 2019. "A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 793-820, August.
- Ahmet B. Keha & Ismael R. de Farias & George L. Nemhauser, 2006. "A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization," Operations Research, INFORMS, vol. 54(5), pages 847-858, October.
- Young Woong Park & Diego Klabjan, 2020. "Subset selection for multiple linear regression via optimization," Journal of Global Optimization, Springer, vol. 77(3), pages 543-574, July.
- Jon Lee & Bai Zou, 2014. "Optimal rank-sparsity decomposition," Journal of Global Optimization, Springer, vol. 60(2), pages 307-315, October.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cor:louvrp:1634. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.