TY - DATA
T1 - An efficient exact approach for the constrained shortest path tour problem
AU - Ferone, Daniele
AU - Festa, Paola
AU - Guerriero, Francesca
DO - 10.6084/M9.FIGSHARE.7599194.V1
UR - https://tandf.figshare.com/articles/An_efficient_exact_approach_for_the_constrained_shortest_path_tour_problem/7599194/1
AB - Given a directed graph with non-negative arc lengths, the Constrained Shortest Path Tour Problem (CSPTP) is aimed at finding a shortest path from a single-origin to a single-destination, such that a sequence of disjoint and possibly different-sized node subsets are crossed in a given fixed order. Moreover, the optimal path must not include repeated arcs. In this paper, for the CSPTP we propose a new mathematical model and a new efficient Branch & Bound method. Extensive computational experiments have been carried out on a significant set of test problems in order to evaluate empirically the performance of the proposed approach.
KW - Biophysics
KW - Cell Biology
KW - Molecular Biology
KW - Neuroscience
KW - Physiology
KW - FOS: Biological sciences
KW - FOS: Biological sciences
KW - Pharmacology
KW - Immunology
KW - FOS: Clinical medicine
KW - FOS: Clinical medicine
KW - 19999 Mathematical Sciences not elsewhere classified
KW - FOS: Mathematics
KW - FOS: Mathematics
KW - Developmental Biology
KW - Science Policy
KW - 60506 Virology
PY - 2019
PB - Taylor & Francis
ER -