Name
Abstract | ||
|---|---|---|
Given a directed graph with non-negative arc lengths, the Constrained Shortest Path Tour Problem () 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 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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1080/10556788.2018.1548015 | OPTIMIZATION METHODS & SOFTWARE |
Keywords | DocType | Volume |
Shortest path problems,shortest path tour problem,capacity constraints,branch & bound | Journal | 35 |
Issue | ISSN | Citations |
1 | 1055-6788 | 1 |
PageRank | References | Authors |
0.35 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| daniele ferone | 1 | 19 | 5.78 |
| Paola Festa | 2 | 287 | 25.32 |
| F. Guerriero | 3 | 499 | 42.00 |