Exact algorithms for the Equitable Traveling Salesman Problem-Reference-Cited by-同舟云学术

Exact algorithms for the Equitable Traveling Salesman Problem

Published:2017-09 Issue:2 Volume:261 Page:475-485
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Kinable Joris,Smeulders Bart^ORCID,Delcour Eline,Spieksma Frits C.R.

Publisher

Elsevier BV

Subject

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

Reference29 articles.

1. Market split and basis reduction: Towards a solution of the Cornuéjols-Dawande instances;Aardal;INFORMS Journal on Computing,2000

2. Implementing the Dantzig–Fulkerson–Johnson algorithm for large traveling salesman problems;Applegate;Mathematical Programming,2003

3. Heuristic algorithms for the 2-period balanced traveling salesman problem in euclidean graphs;Bassetto;European Journal of Operational Research,2011

4. Twin-constrained hamiltonian paths on threshold graphs;Becker,2010

5. The color-balanced spanning tree problem;Berežný;Kybernetika,2005

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

1. Solution of maximum scatter traveling salesman problem through evolutionary approaches;Applied Soft Computing;2024-09

2. Genetic algorithm to the bi-objective multiple travelling salesman problem;Alexandria Engineering Journal;2024-03

3. Hybrid ITÖ Algorithm for Maximum Scatter Colored Traveling Salesman Problem;The Computer Journal;2024-01-14

4. A hybrid combined algorithm based on intelligent water drops and electromagnetism-like algorithms for fuzzy TSP1;Journal of Intelligent & Fuzzy Systems;2023-01-05

5. A graph convolutional encoder and multi-head attention decoder network for TSP via reinforcement learning;Engineering Applications of Artificial Intelligence;2022-06