Results 91 to 100 of about 16,247 (139)
An efficient heuristic algorithm for the bottleneck traveling salesman problem
OPSEARCH, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ravi Ramakrishnan +2 more
semanticscholar +3 more sources
A novel hybrid simulated annealing algorithm for colored bottleneck traveling salesman problem
Swarm and Evolutionary Computation, 2023 Xueshi Dong +4 more
semanticscholar +3 more sources
Minimax 2-connected subgraphs and the bottleneck traveling salesman problem
Cybernetics, 1980 Е. А. Тимофеев
semanticscholar +4 more sources
A data-guided lexisearch algorithm for the bottleneck travelling salesman problem
International Journal of Operational Research, 2011 The bottleneck travelling salesman problem is to find a Hamiltonian circuit that minimises the maximum arc length in a graph. We first modify an existing lexisearch algorithm by incorporating good upper and lower bounds to obtain exact optimal solution to the problem. Then we present a data-guided lexisearch algorithm.
Zakir Hussain Ahmed
openalex +2 more sources
Guaranteed performance heuristics for the bottleneck travelling salesman problem
Operations Research Letters, 1984 We consider constant-performance, polynomial-time, nonexact algorithms for the minimax or bottleneck version of the Travelling Salesman Problem. It is first shown that no such algorithm can exist for problems with arbitrary costs unless P = NP. However, when costs are positive and satisfy the triangle inequality, we use results pertaining to the ...
Robert Parker, Ronald L. Rardin
openalex +2 more sources
Hybrid Algorithm for Colored Bottleneck Traveling Salesman Problem
, 2018 Dong Xueshi, Dong Wenyong, Yongle Cai
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
Annals of Operations Research, 2023The traveling salesman (or salesperson) problem, short TSP, is of strong interest to many researchers from mathematics, economics, and computer science.
Sophia Saller +2 more
semanticscholar +1 more source
Optim. Methods Softw., 2020
The precedence constrained traveling salesman (TSP-PC), also known as sequential ordering problem (SOP), consists of finding an optimal tour that satisfies the namesake constraints.
Y. Salii, A. Sheka
semanticscholar +1 more source
The precedence constrained traveling salesman (TSP-PC), also known as sequential ordering problem (SOP), consists of finding an optimal tour that satisfies the namesake constraints.
Y. Salii, A. Sheka
semanticscholar +1 more source
Warm-Starting PCE for Traveling Salesman Problem
Brazilian journal of physicsVariational quantum algorithms are promising for combinatorial optimization, but their scalability is often limited by qubit-intensive encoding schemes.
Rafael Simões do Carmo +4 more
semanticscholar +1 more source
Parallel Environments for Traveling Salesman Problems Using Reinforcement Learning
International Conference on Cyber Security and Cloud ComputingThe traveling salesman problem (TSP) is NP-hard and difficult to solve since the search space increases significantly with problem size. Reinforcement learning (RL) is a promising method for its powerful search abilities with the assistance of GPUs ...
Ming Zhu, Zhiqiang Pu
semanticscholar +1 more source