It is well-known that few combinatorial optimization problems can be solved effectively by dynamic programming alone, since the number of vertices of the state space graph is enormous. What we are proposing here is a general relaxation procedure whereby the state-space associated with a given dynamic programming recursion is relaxed in such a way that the solution to the relaxed recursion provides a bound which could be embedded in general branch and bound schemes for the solution of the problem. This state space relaxation method is analogous to Langrangian relaxation in integer programming. This paper gives a survey of this new methodology, and gives, as examples, applications to the traveling salesman problem (TSP), the timeconstrained TSP and the vehicle routing problem (VRP). Valid state space relaxations are discussed for these problems and several bounds are derived in each case. Subgradient optimization and “state space ascent” are discussed as methods of maximizing the resulting lower bounds. More details of the procedures surveyed in this paper can be found in [2 ,3 ,41.
[1]
Thomas L. Morin,et al.
COMPUTATIONAL ADVANCES IN DYNAMIC PROGRAMMING
,
1978
.
[2]
Richard M. Karp,et al.
The Traveling-Salesman Problem and Minimum Spanning Trees
,
1970,
Oper. Res..
[3]
George L. Nemhauser,et al.
The Traveling Salesman Problem: A Survey
,
1968,
Oper. Res..
[4]
Ward Whitt,et al.
Approximations of Dynamic Programs, I
,
1978,
Math. Oper. Res..
[5]
B. Fox.
Discretizing dynamic programs
,
1973
.
[6]
Paolo Toth,et al.
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
,
1981,
Math. Program..
[7]
B. Fox.
Finite-state approximations to denumerable-state dynamic programs
,
1971
.
[8]
A. M. Geoffrion.
Lagrangean Relaxation and Its Uses in Integer Programming
,
1972
.
[9]
Philip Wolfe,et al.
Validation of subgradient optimization
,
1974,
Math. Program..