Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope
From MaRDI portal
Publication:941053
Recommendations
- scientific article; zbMATH DE number 1517139
- On cardinality constrained cycle and path polytopes
- scientific article; zbMATH DE number 2208641
- Polyhedral aspects of cardinality constrained combinatorial optimization problems
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
Cites work
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- Algorithms for the weight constrained shortest path problem
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1517139 (Why is no real title available?)
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- Network flows. Theory, algorithms, and applications.
Cited in
(3)
This page was built for publication: Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941053)