Results 151 to 160 of about 59,482 (207)
An efficient coverage path planning method for UAV in complex concave regions. [PDF]
Sci RepWu W, Wang Z, Lin L, Chang X, Tian L.
europepmc +1 more source
Research on 3D Path Optimization for an Inspection Micro-Robot in Oil-Immersed Transformers Based on a Hybrid Algorithm. [PDF]
Sensors (Basel)Feng J, Liu X, Ji H, He C, Liu L.
europepmc +1 more source
Advances in Quantum Computation in NISQ Era. [PDF]
Entropy (Basel)Xie XD, Zhang X, Koczor B, Yuan X.
europepmc +1 more source
How our advisory board members are using generative AI in teaching. [PDF]
Patterns (N Y)Patel P, Mani G.
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
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