Parallelization of TSP Solving in CP-Reference-Cited by-同舟云学术

Parallelization of TSP Solving in CP

Published:2020 Issue: Volume: Page:410-426
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Isoart Nicolas,Régin Jean-Charles

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-58475-7_24

Reference13 articles.

1. Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesmanproblem: A Computational Study. Princeton University Press, Princeton (2006)

2. Lecture Notes in Computer Science;P Benchimol,2010

3. Benchimol, P., Van Hoeve, W.J., Régin, J.C., Rousseau, L.M., Rueher, M.: Improved filtering for weighted circuit constraints. Constraints 17(3), 205–233 (2012). https://hal.archives-ouvertes.fr/hal-01344070

4. Fages, J.G., Lorca, X., Rousseau, L.M.: The salesman and the tree: the importance of search in CP. Constraints 21(2), 145–162 (2016)

5. Haralick, R., Elliott, G.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14, 263–313 (1979)

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

1. Defining Parallel Local Search Procedures with Neighborhood Combinators;SN Computer Science;2022-04-20

2. Improving the Robustness of EPS to Solve the TSP;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2022

3. Towards Distributed Local Search Through Neighborhood Combinators;Proceedings of the 10th International Conference on Operations Research and Enterprise Systems;2021