4.7 Article

A library for continuous convex separable quadratic knapsack problems

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 229, Issue 1, Pages 37-40

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2013.02.038

Keywords

Quadratic programming; Continuous Nonlinear Resource Allocation Problem; Lagrangian relaxation; Optimization software

Ask authors/readers for more resources

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. (C) 2013 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available