Author:
Martin Olivier C.,Otto Steve W.
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference34 articles.
1. O. Martin, S.W. Otto and E.W. Felten, Large-step Markov chains for the traveling salesman problem, Complex Syst. 5(1991)299–326.
2. O. Martin, S.W. Otto and E.W. Felten, Large-step Markov chains for the TSP incorporating local search heuristics, Oper. Res. Lett. 11(1992)219–224.
3. O.C. Martin and S.W. Otto, Partitioning of unstructured meshes for load balancing, Concurrency: Practice and Experience 7(1995)303–314.
4. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (eds.),The Traveling Salesman Problem (Wiley, 1984).
5. M.W. Padberg and G. Rinaldi, A branch and cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Rev. 33(1991)60.
Cited by
130 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献