Title:

Breakpoint searching algorithms for the continuous quadratic knapsack problem

Subtitle:

Raport Badawczy = Research Report ; RB/77/2002

Creator:

Kiwiel, Krzysztof

Publisher:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Place of publishing:

Warszawa

Date issued/created:

2002

Description:

17 pages ; 21 cm ; Bibliography p. 16-17

Subject and Keywords:

Convex programming ; Programowanie wypukłe ; Nonlinear programming ; Programowanie nieliniowe ; Quadratic programming ; Programowanie kwadratowe ; Separable programming ; Programowanie separowalne ; Singly constrained quadratic program

Abstract:

The paper presents several linear time algorithms for the continuous quadratic knapsack problem. It is shown that, out of the seven existing linear time algorithms, two can be improved, and the remaining five fail on simple counterexamples.

Relation:

Raport Badawczy = Research Report

Resource type:

Text

Detailed Resource Type:

Report

Source:

RB-2002-77

Language:

eng

Language of abstract:

eng

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Access:

Open