A library for continuous convex separable quadratic knapsack problems

The Continuous Convex Separable Quadratic Knapsack problem (CQKnP) is an easy but useful model that has very many different applications. Although the problem can be solved quickly, it must typically be solved very many times within approaches to (much) more difficult models; hence an efficient solution approach is required. We present and discuss a small open-source library for its solution that we have recently developed and distributed.

MoreLess

Year of publication:	2013
Authors:	Frangioni, Antonio ; Gorgone, Enrico
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 229.2013, 1, p. 37-40
Publisher:	Elsevier
Subject:	Quadratic programming \| Continuous Nonlinear Resource Allocation Problem \| Lagrangian relaxation \| Optimization software

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010871291