Lagrangean methods for the 0-1 Quadratic Knapsack Problem
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 92 (1996)
Issue (Month): 2 (July)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- X. Zheng & X. Sun & D. Li & Y. Xu, 2012. "On reduction of duality gap in quadratic knapsack problems," Journal of Global Optimization, Springer, vol. 54(2), pages 325-339, October.
- Bretthauer, Kurt M. & Shetty, Bala, 2002. "The nonlinear knapsack problem - algorithms and applications," European Journal of Operational Research, Elsevier, vol. 138(3), pages 459-472, May.
- Billionnet, Alain & Faye, Alain & Soutif, Eric, 1999. "A new upper bound for the 0-1 quadratic knapsack problem," European Journal of Operational Research, Elsevier, vol. 112(3), pages 664-672, February.
- Billionnet, Alain & Soutif, Eric, 2004. "An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem," European Journal of Operational Research, Elsevier, vol. 157(3), pages 565-575, September.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.