Data structures and ejection chains for solving large-scale traveling salesman problems-Reference-Cited by-同舟云学术

Data structures and ejection chains for solving large-scale traveling salesman problems

Published:2005-01 Issue:1 Volume:160 Page:154-171
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Gamboa Dorabela,Rego César,Glover Fred

Publisher

Elsevier BV

Subject

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

Reference10 articles.

1. A data structure useful for finding Hamiltonian cycles;Chrobak;Theoretical Computer Science,1990

2. Data structures for traveling salesman;Fredman;Journal of Algorithms,1995

3. D. Gamboa, C. Rego, F. Glover, Implementation analysis of efficient heuristic algorithms for the traveling salesman problem, Computers and Operations Research, in press

4. New ejection chain and alternating path methods for traveling salesman problems;Glover;Computer Science and Operations Research,1992

5. D.S. Johnson, L. McGeogh, F. Glover, C. Rego, 8th DIMACS Implementation Challenge: The Traveling Salesman Problem, Technical report, AT&T Labs, 2000, http://www.research.att.com/~dsj/chtsp/

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

1. Heuristic and Metaheuristic Algorithms for the Traveling Salesman Problem;Encyclopedia of Optimization;2024

2. A New Data Structure - Satellite List for Solving Colored Traveling Salesman Problems;2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC);2023-10-01

3. N-Body Simulation Inspired by Metaheuristics Optimization;Computer Systems Science and Engineering;2022

4. Reverse Logistic Processes for Glass Container Reuse;Environmental Processes;2021-01-12

5. On the Resilience of Ant Algorithms. Experiment with Adapted MMAS on TSP;Mathematics;2020-05-09