On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem

K. C. Kiwiel ()
Additional contact information
K. C. Kiwiel: Systems Research Institute

Journal of Optimization Theory and Applications, 2007, vol. 134, issue 3, No 12, 549-554

Abstract: Abstract We give a linear time algorithm for the continuous quadratic knapsack problem which is simpler than existing methods and competitive in practice. Encouraging computational results are presented for large-scale problems.

Keywords: Nonlinear programming; Convex programming; Quadratic programming; Separable programming; Singly-constrained quadratic program (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-007-9259-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:134:y:2007:i:3:d:10.1007_s10957-007-9259-0

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-007-9259-0

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().