Author:
Fischetti Matteo,Toth Paolo
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference26 articles.
1. E. Balas and N. Christofides, “A restricted Lagrangean approach to the traveling salesman problem,”Mathematical Programming 21 (1981) 19–46.
2. E. Balas and P. Toth, “Branch and bound methods,” in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985).
3. M. Bellmore and J.C. Malone, “Pathology of traveling salesman subtour elimination algorithms,”Operations Research 19 (1971) 278–307.
4. P.M. Camerini, L. Fratta and F. Maffioli, “A note on finding optimum branchings,”Networks 9 (1979) 309–312.
5. P.M. Camerini, L. Fratta and F. Maffioli, “Thek best spanning arborescences of a network,”Networks 10 (1980) 91–110.
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献