Lagrangean methods for the 0–1 Quadratic Knapsack Problem
Authors:
- Philippe MichelonPMPhilippe Michelon
- Louis VeilleuxLVLouis Veilleux
- 1 July 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 92 (2) , 326-341
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Lagrangean methods for 0–1 quadratic problemsDiscrete Applied Mathematics, 1993
- On the supermodular knapsack problemMathematical Programming, 1989
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- Lagrangean decomposition: A model yielding stronger lagrangean boundsMathematical Programming, 1987
- Methods of Nonlinear 0-1 Programming1979
- Minimum cuts and related problemsNetworks, 1975