Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference18 articles.
1. M. Bellmore and J.C. Malone, “Pathology of travelling salesman subtour elimination algorithms”,Operations Research 19 (1971) 278–307.
2. M. Bellmore and G.L. Nemhauser, “The travelling salesman problem: a survey”,Operations Research 16 (1968) 538–558.
3. G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, “Solution of a large scale travelling salesman problem”,Operations Research 2 (1954) 393–410.
4. G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, “On a linear programming, combinatorial approach to the travelling salesman problem”,Operations Research 7 (1959) 58–66.
5. W.L. Eastman, “Linear programming with pattern constraints”, Ph.D. Dissertation, Harvard University, Cambridge, Mass., (1958).
Cited by
66 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献