Results 181 to 190 of about 4,258 (228)

Soil2Cover: Coverage path planning minimizing soil compaction for sustainable agriculture. [PDF]

Precis Agric
Mier G, Vélez S, Valente J, de Bruin S.
europepmc   +1 more source

Weekly home healthcare routing and scheduling with overlapping patient clusters. [PDF]

Health Syst (Basingstoke)
Zhao A, Bard JF.
europepmc   +1 more source

Dynamics-aware deep predictive adaptive scanning optical coherence tomography. [PDF]

Biomed Opt Express
Rajani DM, Seghizzi F, Lai YL, Buchta KG, Draelos M.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The Traveling Salesman Problem with Backhauls

Computers & Operations Research, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Gendreau, Alain Hertz, Gilbert Laporte   +2 more
openaire   +1 more source

On the Dubins Traveling Salesman Problem

IEEE Transactions on Automatic Control, 2012
We study the traveling salesman problem for a Dubins vehicle. We prove that this problem is NP-hard, and provide lower bounds on the approximation ratio achievable by some recently proposed heuristics. We also describe new algorithms for this problem based on heading discretization, and evaluate their performance numerically.
Jerome Le Ny, Eric Feron, Emilio Frazzoli   +2 more
openaire   +1 more source

The Traveling Salesman Problem: A Survey

Operations Research, 1968
A survey and synthesis of research on the traveling salesman problem is given. We begin by defining the problem and presenting several theorems. This is followed by a general classification of the solution techniques and a detailed description of some of the proven methods. Finally a summary of computational results is given.
Mandell Bellmore, George L. Nemhauser
openaire   +1 more source

Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem

Information Sciences, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yao-Nan Lien, Y. W. Eva Ma, Benjamin W. Wah   +2 more
openaire   +3 more sources

Traveling Salesman Problem with Clustering

Journal of Statistical Physics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schneider, Johannes J., Bukur, Thomas, Krause, Antje   +2 more
openaire   +1 more source

Risky traveling salesman problem

European Journal of Operational Research, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nikolaos Papadakos, George Tzallas-Regas, Berç Rustem, Joanne Thoms   +3 more
openaire   +2 more sources

TRAVELING SALESMAN PROBLEM OF SEGMENTS

International Journal of Computational Geometry & Applications, 2004
In this paper, we present a polynomial time approximation scheme (PTAS) for a variant of the traveling salesman problem (called segment TSP) in which a traveling salesman tour is sought to traverse a set of n ∊-separated segments in two dimensional space.
Jinhui Xu 0001, Zhiyong Lin, Yang Yang 0012, Ronald Berezney   +3 more
openaire   +1 more source