This paper describes and studies the shortest path tour problems, special network flow problems recently proposed in the literature that have originated from applications in combinatorial optimization problems with precedence constraints to be satisfied, but have found their way into numerous practical applications, such as for example in warehouse management and control in robot motion planning. Several new variants belonging to the shortest path tour problems family are considered and the relationship between them and special facility location problems is examined. Finally, future directions in shortest path tour problems research are discussed in the last section.
On some special network flow problems: the Shortest Path Tour Problems / Festa, Paola. - 20:(2012), pp. 245-263. [10.1007/978-1-4614-3906-6_13]
On some special network flow problems: the Shortest Path Tour Problems
FESTA, PAOLA
2012
Abstract
This paper describes and studies the shortest path tour problems, special network flow problems recently proposed in the literature that have originated from applications in combinatorial optimization problems with precedence constraints to be satisfied, but have found their way into numerous practical applications, such as for example in warehouse management and control in robot motion planning. Several new variants belonging to the shortest path tour problems family are considered and the relationship between them and special facility location problems is examined. Finally, future directions in shortest path tour problems research are discussed in the last section.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
