Travelling Salesman and Assignment Problems: A Survey-Reference-Cited by-同舟云学术

Travelling Salesman and Assignment Problems: A Survey

Published:1979 Issue: Volume: Page:193-215
ISSN:0167-5060
Container-title:Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium
language:
Short-container-title:

Author:

Burkard Rainer E.

Publisher

Elsevier

Reference118 articles.

1. E. Balas and N. Christofides 1976), A new penalty method for the travelling salesman problem, presented at the IX. Symposium on Mathematical Programming, Budapest, Budapest, Hungary (August 1976).

2. A primal method for the assignment and transportation problem;Balinski;Management Sci.,1964

3. On the assignment polytope;Balinski;SIAM Rev.,1974

4. The alternating basis algorithm for assignment problems;Barr;Math. Programming,1977

5. Pathology of travelling salesman subtour elimination algorithms;Bellmore;Operations Res.,1971

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast approximate bi-objective Pareto sets with quality bounds;Autonomous Agents and Multi-Agent Systems;2022-11-11

2. On some synchronization problems with multiple instances;Journal of Computational and Applied Mathematics;2022-01

3. On a Synchronization Problem With Multiple Instances;SSRN Electronic Journal;2020

4. Recent Development in Methodology for Gene Network Problems and Inferences;Healthcare Analytics: From Data to Knowledge to Healthcare Improvement;2016-08-12

5. Self-organized control in cooperative robots using a pattern formation principle;Physics Letters A;2011-05