Computing in Combinatorial Optimization-Reference-Cited by-同舟云学术

Computing in Combinatorial Optimization

Published:2019 Issue: Volume: Page:27-47
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cook William

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-91908-9_3

Reference90 articles.

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

2. Applegate, D.L., Cook, W.: Solving large-scale matching problems. In: Johnson, D.S., McGeoch, C.C. (eds.) Algorithms for Network Flows and Matching. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 12, pp. 557–576. American Mathematical Society, Providence (1993)

3. Avis, D.: George Dantzig: father of the simplex method. Bull. EATCS 116 (2015)

4. Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)

5. Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM 9, 61–63 (1962)

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

1. A landscape-based analysis of fixed temperature and simulated annealing;European Journal of Operational Research;2023-01

2. A New Commodity Distribution Approach Based on Asymmetric Traveler Salesman Using Ant Colony Algorithm;Industrial Engineering & Management Systems;2022-09-30

3. Research trends in combinatorial optimization;International Transactions in Operational Research;2021-05-27

4. A Causal Framework for Understanding Optimisation Algorithms;Trustworthy AI - Integrating Learning, Optimization and Reasoning;2021