Author:
Laporte Gilbert,Nobert Yves
Subject
Computer Science Applications,Information Systems,Signal Processing
Reference11 articles.
1. G.B. Dantzig, R. Fulkerson, and S. Johnson, “Solution of a large-scale travellingsalesman problem,” Operations Research, 2, 1954, 393–410.
2. A.L. Henry-Labordere, “The record balancing problem: a dynamic programming solution of a generalized travelling salesman problem,” R.I.R.O., B-2, 1969, 43–9.
3. A.H. Land, “The solution of some 100-city travelling salesman problems,” paper presented at the Tenth International Symposium on Mathematical Programming, Montreal, August 1979.
4. G. Laporte and Y. Nobert, “An exact algorithm for minimizing routing and operating costs in depot location,” European Journal of Operational Research, 6, 1981, 224–6.
5. G. Laporte and Y. Nobert, “A cutting planes algorithm for the m-salesmen problem,” Journal ofthe Operational Research Society, 31, 1980, 1017–23.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. SMUG Planner: A Safe Multi-Goal Planner for Mobile Robots in Challenging Environments;IEEE Robotics and Automation Letters;2023-11
2. Integration of ridesharing and activity travel pattern generation;Transportmetrica A: Transport Science;2023-08
3. Collaborative UGV/UAV Path Planning for Inventory Management in Warehouses;2022 Latin American Robotics Symposium (LARS), 2022 Brazilian Symposium on Robotics (SBR), and 2022 Workshop on Robotics in Education (WRE);2022-10-18
4. Learning to Solve Pod Retrieval as Sequential Decision Making Problem;2022 IEEE 17th International Conference on Control & Automation (ICCA);2022-06-27
5. Path planning algorithm ensuring accurate localization of radiation sources;Applied Intelligence;2022-01-07