An exact algorithm for the 0–1 linear knapsack problem with a single continuous variable
No abstract is available for this item.
Volume (Year): 50 (2011)
Issue (Month): 4 (August)
|Contact details of provider:|| Web page: http://www.springer.com/business/operations+research/journal/10898 |
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:50:y:2011:i:4:p:657-673. 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: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.