Improved Lagrangean decomposition: An application to the generalized assignment problem
- 4 May 1990
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 46 (1) , 84-92
- https://doi.org/10.1016/0377-2217(90)90300-z
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Exact methods for the knapsack problem and its generalizationsPublished by Elsevier ,2011
- A revised bound improvement sequence algorithmEuropean Journal of Operational Research, 1988
- Constructive dual methods for discrete programmingDiscrete Applied Mathematics, 1987
- Lagrangean decomposition: A model yielding stronger lagrangean boundsMathematical Programming, 1987
- A new Lagrangian relaxation approach to the generalized assignment problemEuropean Journal of Operational Research, 1986
- A Multiplier Adjustment Method for the Generalized Assignment ProblemManagement Science, 1986
- The bound improving sequence algorithmOperations Research Letters, 1985
- An algorithm for the solution of the 0–1 knapsack problemComputing, 1982
- Validation of subgradient optimizationMathematical Programming, 1974