Results 131 to 140 of about 863 (188)

TrailMap: Pheromone-Based Adaptive Peer Matching for Sustainable Online Support Communities. [PDF]

Biomimetics (Basel)
Ngabo-Woods H, Dunai L, Verdú IS, Turcanu D.   +3 more
europepmc   +1 more source

<i>dandelionR</i>: Single-cell immune repertoire trajectory analysis in R. [PDF]

Comput Struct Biotechnol J
Yu J, Xu X, Borcherding N, Tuong ZK.
europepmc   +1 more source

Dynamic gold rush optimizer: fusing worker adaptation and salp navigation mechanism for enhanced search. [PDF]

Sci Rep
Zhang Y, Adegboye OR, Feda AK, Agyekum EB, Kumar P.   +4 more
europepmc   +1 more source

An enhanced genetic algorithm solution for itinerary recommendation considering various constraints. [PDF]

PeerJ Comput Sci
Şehab M, Turan M.
europepmc   +1 more source

Flood algorithm: a novel metaheuristic algorithm for optimization problems. [PDF]

PeerJ Comput Sci
Ozkan R, Samli R.
europepmc   +1 more source

Simultaneously infer cell pseudotime, velocity field, and gene interaction from multi-branch scRNA-seq data with scPN. [PDF]

NAR Genom Bioinform
Zhou Z, Li J, Xin H, Pan X, Shen HB.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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.
Xu, Jinhui, Lin, Zhiyong, Yang, Yang, Berezney, Ronald   +3 more
openaire   +1 more source

Time-Dependent Travelling Salesman Problem

OPSEARCH, 2005
zbMATH 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, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schneider, Johannes J., Bukur, Thomas, Krause, Antje   +2 more
openaire   +1 more source

Traveling Salesman Problems

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