Problem statement, Evans and Minieka (1992, p. 317) and Eilon et al. (1971, p. 113)
Problem statement as a graph, Evans and Minieka (1992, p. 317)
Problem classifications, Evans and Minieka (1992, pp. 317-318) and Eilon et al. (1971, p. 113)
Typical examples, Evans and Minieka (1992, pp. 318-318)
Properties of the traveling salesman problem, Evans and Minieka (1992, pp. 320-328) and Eilon et al. (1971, pp. 113-116)
Generating solutions by sequential tour building, Eilon et al. (1971, pp. 116-117)
Generating solutions by subtour contraction, Eilon et al. (1971, p. 118)
Dynamic programming model, Eilon et al. (1971, pp. 118-121)
Solved small numerical example, Eilon et al. (1971, pp. 121-123)
Branch and bound algorithm, Eilon et al. (1971, pp. 123-128)
Solved small numerical example, Eilon et al. (1971, pp. 129-132)
Eilon, S., Watson-Gandy, C. D. T. and Christofides, N. Distribution Management: Mathematical Modelling and Practical Analysis. Griffin, London, 1971.
Evans, James R. and Minieka, Edward. Optimization Algorithms for Networks and Graphs, 2nd ed. Marcel Dekker, New York, 1992.
2007-04-10 12:09 am
