A computational evaluation of two subgradient search methods
- 1 January 1987
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 14 (3) , 241-247
- https://doi.org/10.1016/0305-0548(87)90027-x
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Surrogate duality in a branch-and-bound procedure for integer programmingEuropean Journal of Operational Research, 1988
- A Multiplier Adjustment Method for the Generalized Assignment ProblemManagement Science, 1986
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian dualityEuropean Journal of Operational Research, 1979
- On improving relaxation methods by modified gradient techniquesPublished by Springer Nature ,1975
- Validation of subgradient optimizationMathematical Programming, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970