On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem-Reference-Cited by-同舟云学术

On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem

Published:2014-10 Issue:1 Volume:238 Page:87-94
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Hoos Holger H.,Stützle Thomas

Funder

NSERC

FNRS

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference25 articles.

1. Applegate, D. (2012). Personal Communication.

2. The traveling salesman problem: A computational study;Applegate,2006

3. Certification of an optimal TSP tour through 85,900 cities;Applegate;Operations Research Letters,2009

4. Applegate, D., Bixby, R., Chvátal, V., & Cook, W. (2012). The traveling salesman problem, concorde TSP solver. . Version visited last on 15.06.12.

5. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems;Arora;Journal of the ACM,1998

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

1. Quasi-linear time heuristic to solve the Euclidean traveling salesman problem with low gap;Journal of Computational Science;2024-10

2. Improving analytic approximations of TSP tour lengths with adjustment factors;Transportmetrica A: Transport Science;2024-04-29

3. Finding Hamiltonian Cycles with Graph Neural Networks;2023 International Symposium on Image and Signal Processing and Analysis (ISPA);2023-09-18

4. Encoding of everyday objects in older adults: Episodic memory assessment in virtual reality;Frontiers in Aging Neuroscience;2023-03-13

5. Distributed service with proximal capacity and pricing on a two‐sided sharing economy platform;Journal of Operations Management;2022-09-27