Improving the Held and Karp Approach with Constraint Programming-Reference-Cited by-同舟云学术

Improving the Held and Karp Approach with Constraint Programming

Published:2010 Issue: Volume: Page:40-44
ISSN:0302-9743
Container-title:Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
language:
Short-container-title:

Author:

Benchimol Pascal,Régin Jean-Charles,Rousseau Louis-Martin,Rueher Michel,van Hoeve Willem-Jan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-13520-0_6

Reference8 articles.

1. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)

2. Balas, E., Toth, P.: Branch and Bound Methods. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, ch. 10. Wiley, Chichester (1985)

3. Lecture Notes in Computer Science;G. Dooms,2007

4. Held, M., Karp, R.M.: The Traveling-Salesman Problem and Minimum Spanning Trees. Operations Research 18, 1138–1162 (1970)

5. Held, M., Karp, R.M.: The Traveling-Salesman Problem and Minimum Spanning Trees: Part II. Mathematical Programming 1, 6–25 (1971)

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

1. Efficient optimization of the Held–Karp lower bound;Open Journal of Mathematical Optimization;2021-11-03

2. Parallelization of TSP Solving in CP;Lecture Notes in Computer Science;2020

3. Integration of Structural Constraints into TSP Models;Lecture Notes in Computer Science;2019

4. Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem;Lecture Notes in Computer Science;2018

5. Toward unification of exact and heuristic optimization methods;International Transactions in Operational Research;2013-05-07