Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope

DOI10.1007/s11590-008-0084-7zbMath1152.90637OpenAlexW2030981252MaRDI QIDQ941053

Luigi Moccia, Maria Flavia Monaco, Marcello Sammarra

Publication date: 4 September 2008

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-008-0084-7

zbMATH Keywords

polytopesextreme pointsconstrained shortest pathbasic solutions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Complexity analysis and optimization of the shortest path tour problem, A column generation heuristic for a dynamic generalized assignment problem

Cites Work

• Algorithms for the Weight Constrained Shortest Path Problem
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item