Results 111 to 120 of about 232 (135)

Improved model building for cryo-EM maps using local attention and 3D rotary position embedding

Su B, Huang K, Peng Z, Amunts A, Yang J.
europepmc   +1 more source

Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems

IEEE Transactions on Automation Science and Engineering
A bottleneck-minimized colored traveling salesman problem is an important variant of colored traveling salesman problems. It is useful in handling the planning problems with partially overlapped workspace such as the scheduling transportation resources ...
Yangming Zhou, Wenqiang Xu, Mengchu Zhou   +2 more
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

An Algorithm for the Bottleneck Traveling Salesman Problem

Operations Research, 1984
Given a graph with arc costs, the Bottleneck Traveling Salesman Problem is to find a Hamiltonian circuit that minimizes the largest cost of any of its arcs. Lower bounds for the problem (bottleneck assignment problem, bottleneck paths, bottleneck arborescence, cuts) are analyzed and combined to obtain a bounding procedure for a breadth-first branch ...
Silvano Martello, Paolo Tóth
exaly   +3 more sources

A Hybrid Genetic Algorithm for the Bottleneck Traveling Salesman Problem

Transactions on Embedded Computing Systems, 2013
The bottleneck traveling salesman problem is to find a Hamiltonian circuit that minimizes the largest cost of any of its arcs in a graph. A simple genetic algorithm (GA) using sequential constructive crossover has been developed to obtain heuristic solution to the problem.
Zakir Hussain Ahmed
exaly   +2 more sources

The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis

Computers and Operations Research, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abraham P Punnen
exaly   +3 more sources

An efficient heuristic algorithm for the bottleneck traveling salesman problem

Opsearch, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abraham P Punnen, Punnen Abraham P
exaly   +2 more sources

A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph

Information Processing Letters, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abraham P Punnen
exaly   +2 more sources

A novel hybrid simulated annealing algorithm for colored bottleneck traveling salesman problem

Swarm and Evolutionary Computation, 2023
Xueshi Dong, Fanfan Shen, Biyue Li
exaly   +2 more sources

Retracted: Competition Decision for Bottleneck Traveling Salesman Problem Based on Big Data Mining Algorithm with Multi-Segment Support

2018 3rd International Conference on Smart City and Systems Engineering (ICSCSE), 2018
Due to the existence of multiple constraints and multiple optimization objectives, the competition decision for bottleneck traveling salesman problem is very difficult. The paper proposes the competition decision for bottleneck traveling salesman based on big data mining algorithm with multi-segment support.
Dai Ying
openaire   +2 more sources

A Multi-Start Iterated Local Search Algorithm for the Bottleneck Traveling Salesman Problem

2022 IEEE 19th India Council International Conference (INDICON), 2022
Pandiri Venkaṭesh
exaly   +2 more sources