Results 151 to 160 of about 4,258 (228)

The family traveling salesman problem.

open access: yes, 2019
Consider a depot, a partition of the set of nodes into subsets, called families, and a cost matrix. The objective of the family traveling salesman problem (FTSP) is to find the minimum cost circuit that starts and ends at the depot and visits a given number of nodes per family.
openaire   +1 more source

A novel approach for solving travelling thief problem using enhanced simulated annealing. [PDF]

open access: yesPeerJ Comput Sci, 2021
Ali H   +5 more
europepmc   +1 more source

High-energy X-ray phase-contrast CT of an adult human chest phantom. [PDF]

open access: yesSci Rep
Ahlers JN   +17 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy