An exact search for the solution of the surrogate dual of the 0–1 bidimensional knapsack problem
- 1 August 1993
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 68 (3) , 413-421
- https://doi.org/10.1016/0377-2217(93)90197-u
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Lagrangean decomposition: A model yielding stronger lagrangean boundsMathematical Programming, 1987
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimalityMathematical Programming, 1985
- An algorithm for the solution of the 0–1 knapsack problemComputing, 1982
- Calculating surrogate constraintsMathematical Programming, 1980
- Constructive Duality in Integer ProgrammingSIAM Journal on Applied Mathematics, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- Surrogate Mathematical ProgrammingOperations Research, 1970
- Methods for the Solution of the Multidimensional 0/1 Knapsack ProblemOperations Research, 1967