The Generalized Cardinality-Constrained Shortest Path Problem (GCCSPP) consists in finding the minimum cost path in a digraph, using at most r arcs in a subset F of the arc set. We propose an algebraic characterization of the extreme points of the associated polytope, and then we show that it is equivalent to the geometric one, obtained extending to the GCCSPP some known results for the cardinality-constrained shortest path problem. © 2008 Springer-Verlag.
All Science Journal Classification (ASJC) codes
- Control and Optimization
Monaco, M. F., Sammarra, M., & Moccia, L. (2008). Some observations about the extreme points of the Generalized Cardinality-Constrained Shortest Path Problem polytope. Optimization Letters, 2(4), 577 - 585. https://doi.org/10.1007/s11590-008-0084-7