Classifying traveling salesman problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
In the fields such as intelligent transport and multiple tasks cooperation, the model scale constructed by colored bottleneck traveling salesman problem (CBTSP) tends to large scale, and therefore it is necessary to study the large scale CBTSP and its ...
Wenyong DONG, Xueshi DONG, Yufeng WANG
doaj +2 more sources
Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem. [PDF]
Stodola P +3 more
europepmc +1 more source
A probabilistic traveling salesman problem: a survey [PDF]
Abir Henchiri +2 more
doaj +1 more source
Probabilistic greedy algorithm solver using magnetic tunneling junctions for traveling salesman problem. [PDF]
Zhang R +17 more
europepmc +1 more source
Efficient bit labeling in factorization machines with annealing for traveling salesman problem. [PDF]
Koshikawa S, Hosaka A, Yoshida T.
europepmc +1 more source
Genetic codes optimized as a traveling salesman problem. [PDF]
Attie O, Sulkow B, Di C, Qiu W.
europepmc +1 more source
A carbon aware ant colony system for the sustainable generalized traveling salesman problem. [PDF]
Lin M, Schaposnik LP.
europepmc +1 more source
A transformer-based structure-aware model for tackling the traveling salesman problem. [PDF]
Zhao CS, Wong LP.
europepmc +1 more source
On approximating a new generalization of traveling salesman problem. [PDF]
Huang Z, Liao X, Naik PA, Lu X.
europepmc +1 more source

