Relaxed tours and path ejections for the traveling salesman problem-Reference-Cited by-同舟云学术

Relaxed tours and path ejections for the traveling salesman problem

Published:1998-04 Issue:2-3 Volume:106 Page:522-538
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Rego César

Publisher

Elsevier BV

Subject

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

Reference30 articles.

1. Theory of Graphs and its Applications;Berge,1962

2. Worst-case analysis of a new heuristic for the traveling salesman problem;Christofides,1976

3. Performance of various computers using standard linear equations software;Dongarra,1997

4. Fast clustering algorithms;Dorndorf;ORSA Journal on Computing,1994

5. Covers and packings in family of sets;Edmonds;Bulletin of the American Mathematical Society,1962

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

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

2. Scatter search for capacitated minimum spanning tree;Advances in Engineering Software;2023-12

3. A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP;OPSEARCH;2019-08-31

4. Implementation issues in optimization algorithms: do they matter?;Journal of Experimental & Theoretical Artificial Intelligence;2019-03-05

5. Automatically discovering clusters of algorithm and problem instance behaviors as well as their causes from experimental data, algorithm setups, and instance features;Applied Soft Computing;2018-12