State‐space relaxation procedures for the computation of bounds to routing problems
- 1 June 1981
- Vol. 11 (2), 145-164
- https://doi.org/10.1002/net.3230110207
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Approximations of Dynamic Programs, IIMathematics of Operations Research, 1979
- Approximations of Dynamic Programs, IMathematics of Operations Research, 1978
- Validation of subgradient optimizationMathematical Programming, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Science and Business Media LLC ,1974
- Discretizing dynamic programsJournal of Optimization Theory and Applications, 1973
- Finite-state approximations to denumerable-state dynamic programsJournal of Mathematical Analysis and Applications, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970