<i>dandelionR</i>: Single-cell immune repertoire trajectory analysis in R. [PDF]
Comput Struct Biotechnol JYu 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 RepZhang Y +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 SciOzkan 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 BioinformZhou Z, Li J, Xin H, Pan X, Shen HB.
europepmc +1 more source
On the Complexity of a Clustered Subclass of the Traveling Salesman Problem
Guo, ChenFeng
openalex +1 more source
An efficient transformation of the generalized traveling salesman problem
, 2006 Charles Edward Noon, James C. Bean
openalex +1 more source
Related searches:
Travelling Salesman Problem Optimization Using Genetic Algorithm
2019 Amity International Conference on Artificial Intelligence (AICAI), 2019Optimization problem is which mainly focuses on finding feasible solution out of all possible solutions. Travelling salesman problem belongs to this one.
Sahib Singh Juneja +5 more
semanticscholar +1 more source
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