×
Houck, David J. jun.; Picard, Jean-Claude; Queyranne, Maurice; Vemuganti, R. R.

The travelling salesman problem as a constrained shortest path problem: Theory and computational experience. (English) Zbl 0446.90084

Opsearch 17, 93-109 (1980).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0446.90084

Cited in 34 Documents

MSC:

90C35 Programming involving graphs or networks
65K05 Numerical mathematical programming methods
05C35 Extremal problems in graph theory

Keywords:

travelling salesman problem; constrained shortest path problem; computational experience; n-path relaxation; optimal vertex penalties; branch and bound algorithm
Cite Review PDF