Results 11 to 20 of about 149 (87)

An O(n) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices

open access: yesDiscrete Applied Mathematics, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

Algorithm for DNA sequence assembly by quantum annealing. [PDF]

open access: yesBMC Bioinformatics, 2022
Nałęcz-Charkiewicz K, Nowak RM.
europepmc   +1 more source

The bottleneck traveling salesman problem and some variations

open access: yes, 2010
We present powerful heuristics for the bottleneck traveling salesman problem (BTSP) and closely related problems such as the maximum scatter traveling salesman problem (MSTSP) and the balanced traveling salesman problem, the later being a new problem which we in- troduce. Extensive computational results are presented.
openaire   +1 more source

Home - About - Disclaimer - Privacy