A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
Download full text from publisher
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Silvano Martello & David Pisinger & Paolo Toth, 1999. "Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem," Management Science, INFORMS, vol. 45(3), pages 414-424, March.
- Dahmani, Isma & Hifi, Mhand & Wu, Lei, 2016. "An exact decomposition algorithm for the generalized knapsack sharing problem," European Journal of Operational Research, Elsevier, vol. 252(3), pages 761-774.
More about this item
Keywordsprogramming: integer algorithms; branch and bound/dynamic programming;
StatisticsAccess and download statistics
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:inm:ormnsc:v:30:y:1984:i:6:p:765-771. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc). General contact details of provider: http://edirc.repec.org/data/inforea.html .
We have no references for this item. You can help adding them by using this form .