Results 131 to 140 of about 2,267 (186)
Optimization of offshore wind farm inspection paths based on K-means-GA. [PDF]
PLoS OnePeng Z +5 more
europepmc +1 more source
ADVCSO: Adaptive Dynamically Enhanced Variant of Chicken Swarm Optimization for Combinatorial Optimization Problems. [PDF]
Biomimetics (Basel)Wu K, Wang L, Liu M.
europepmc +1 more source
Efficient planning and implementation of optimal foraging strategies under energetic constraints. [PDF]
PNAS NexusGuo Y, Hermundstad AM.
europepmc +1 more source
Automatic Extraction and Compensation of P-Bit Device Variations in Large Array Utilizing Boltzmann Machine Training. [PDF]
Micromachines (Basel)Zhang B +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
TRAVELING SALESMAN PROBLEM OF SEGMENTS
International Journal of Computational Geometry & Applications, 2004In 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.
Xu, Jinhui +3 more
openaire +1 more source
Time-Dependent Travelling Salesman Problem
OPSEARCH, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bhavani, V., Sundara Murthy, M.
openaire +2 more sources
Traveling Salesman Problem with Clustering
Journal of Statistical Physics, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schneider, Johannes J. +2 more
openaire +1 more source
2017
This chapter is devoted to the Traveling Salesman Problem (TSP), one of the most famous problems of combinatorial optimization. Compact ILP models for this problem have been proposed since a long time, but most of them are not effective for computational purposes.
Giuseppe Lancia, Paolo Serafini
openaire +1 more source
This chapter is devoted to the Traveling Salesman Problem (TSP), one of the most famous problems of combinatorial optimization. Compact ILP models for this problem have been proposed since a long time, but most of them are not effective for computational purposes.
Giuseppe Lancia, Paolo Serafini
openaire +1 more source
2013
The traveling salesman problem (TSP) has commanded much attention from mathematicians and computer scientists specifically because it is so easy to describe and so difficult to solve. In this paper the problem is defined, various solutiona approaches are discussed and some applications are described.
Hoffman K, Padberg M, Rinaldi G
openaire +1 more source
The traveling salesman problem (TSP) has commanded much attention from mathematicians and computer scientists specifically because it is so easy to describe and so difficult to solve. In this paper the problem is defined, various solutiona approaches are discussed and some applications are described.
Hoffman K, Padberg M, Rinaldi G
openaire +1 more source
Risky traveling salesman problem
European Journal of Operational Research, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Papadakos, Nikolaos +3 more
openaire +2 more sources