Bibliography

1

O. Bor'uvka, "On a certain minimal problem" (in Czech), Práce Moravské Prírodovedecké Spolecnosti 3 (1926), 37-58.

2

G. B. Dantzig, R. Fulkerson, and S. M. Johnson, "Solution of a large-scale traveling salesman problem", Operations Research 2 (1954), 393-410.

3

R. E. Gomory, "Outline of an algorithm for integer solutions to linear programs", Bulletin of the American Mathematical Society 64 (1958), 275-278.

4

R. E. Gomory, "Solving linear programs in integers", in: Combinatorial Analysis (R. E. Bellman and M. Hall, Jr., eds.), Proc. Symp. Appl. Math. X (1960), 211-216.

5

R. E. Gomory, "An algorithm for integer solutions to linear programs", in: Recent Advances in Mathematical Programming (R. L. Graves and P. Wolfe, eds.), McGraw-Hill, New York, 1963, pp. 269-302.

6

M. W. Padberg and M. Grötschel, "Polyhedral computations", in: The Traveling Salesman Problem (E. L. Lawler et al., eds.), Wiley, Chichester, 1995, pp.307-360.

7

M. W. Padberg and G. Rinaldi, "A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems", SIAM Review 33 (1991), 60-100.

This document was generated using the LaTeX2HTML translator Version 99.2beta8 (1.42)