Results 171 to 180 of about 4,732 (227)

Generating information-dense promoter sequences with optimal string packing. [PDF]

PLoS Comput Biol
Andreani V, South EJ, Dunlop MJ.
europepmc   +1 more source

Optimising parent selection in plant breeding: comparing metaheuristic algorithms for genotype building. [PDF]

Theor Appl Genet
Yadav S, Dillon S, McNeil M, Dinglasan E, Mago R, Dodds P, Hickey L, Hayes BJ.   +7 more
europepmc   +1 more source

A New Single-Parameter Bees Algorithm. [PDF]

Biomimetics (Basel)
Suluova HF, Pham DT.
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

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

Traveling Salesman

, 1966
openaire   +1 more source

GPU-accelerated modeling of biological regulatory networks. [PDF]

Sci Rep
Reimer J, Saha P, Chen C, Dhar N, Byrns B, Rayan S, Broderick G.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The travelling salesman and the PQ-tree

Mathematics of Operations Research, 1996
Let D = (dij ) be the n × n distance matrix of a set of n cities {1, 2, …, n}, and let T be a PQ-tree with node degree bounded by d that represents a set Π(T) of permutations over {1, 2, …, n}. We show how to compute for D in O(2 dn 3) time the shortest travelling salesman tour contained in Π(T).
Burkard, R.E., Deineko, V.G., Woeginger, G.J.   +2 more
openaire   +4 more sources

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