Author:
Balas Egon,Christofides Nicos
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference19 articles.
1. E. Balas, “Cutting planes from conditional bounds: A new approach to set covering”,Mathematical Programming Studies 12 (1980) 19–36.
2. E. Balas and N. Christofides, “A new penalty method for the traveling salesman problem”, Paper presented at the Ninth International Symposium on Mathematical Programming, Budapest, August 1976.
3. M. Bellmore and J.C. Malone, “Pathology of traveling salesman subtour elimination algorithms”,Operations Research 19 (1971) 278–307.
4. M. Bellmore and G.L. Nemhauser, “The traveling salesman problem: A survey”,Operations Research 16 (1968) 538–558.
5. R.E. Burkard, “Traveling salesman and assignment problems: A survey”,Annals of Discrete Mathematics 4 (1979) 193–217.
Cited by
118 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献