Results 111 to 120 of about 5,636,127 (168)

Solving multi-depot closed-path multiple traveling salesman problem using k-means++ hierarchical clustering and neural combinatorial networks. [PDF]

Sci Rep
Zhao CS, Wong LP, Fung C.
europepmc   +1 more source

Efficient bit labeling in factorization machines with annealing for traveling salesman problem. [PDF]

Sci Rep
Koshikawa S, Hosaka A, Yoshida T.
europepmc   +1 more source

Genetic codes optimized as a traveling salesman problem. [PDF]

PLoS One, 2019
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]

Sci Rep
Lin M, Schaposnik LP.
europepmc   +1 more source

A transformer-based structure-aware model for tackling the traveling salesman problem. [PDF]

PLoS One
Zhao CS, Wong LP.
europepmc   +1 more source

On approximating a new generalization of traveling salesman problem. [PDF]

Heliyon
Huang Z, Liao X, Naik PA, Lu X.
europepmc   +1 more source

A Revisiting Method Using a Covariance Traveling Salesman Problem Algorithm for Landmark-Based Simultaneous Localization and Mapping. [PDF]

Sensors (Basel), 2019
Ryu H.
europepmc   +1 more source

A three-phase algorithm for the pollution traveling Salesman problem. [PDF]

Heliyon
García-Vasquez K, Linfati R, Escobar JW.   +2 more
europepmc   +1 more source

The Traveling Salesman Problem (TSP): A Spatial Navigation Task for Rats. [PDF]

Bio Protoc, 2018
Blaser RE.
europepmc   +1 more source

Reachability cuts for the vehicle routing problem with time windows [PDF]

This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived from precedence constraints in the Asymmetric Traveling Salesman Problem ...
Lysgaard, Jens
core