A new Lagrangian relaxation approach to the generalized assignment problem
- 31 December 1986
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 27 (3), 313-323
- https://doi.org/10.1016/0377-2217(86)90328-0
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An O(n) algorithm for the multiple-choice knapsack linear programMathematical Programming, 1984
- A note of the knapsack problem with special ordered setsOperations Research Letters, 1981
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- Surrogate duality in a branch‐and‐bound procedureNaval Research Logistics Quarterly, 1981
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Some relationships between lagrangian and surrogate duality in integer programmingMathematical Programming, 1979
- A branch and bound algorithm for the generalized assignment problemMathematical Programming, 1975
- Validation of subgradient optimizationMathematical Programming, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Science and Business Media LLC ,1974
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of ResourcesOperations Research, 1963