Polyhedral aspects of cardinality constrained combinatorial optimization problems
From MaRDI portal
Paths and cycles (05C38) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial optimization (90C27) Dynamic programming (90C39)
Recommendations
Cited in
(10)- Lot-sizing polyhedra with a cardinality constraint
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
- Cardinality constraints and systems of restricted representatives
- On cardinality constrained polymatroids
- On the cardinality constrained matroid polytope
- Polyhedral techniques in combinatorial optimization II: applications and computations
- Cardinality constrained combinatorial optimization: complexity and polyhedra
- Polyhedral techniques in combinatorial optimization I: Theory
- Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope
- On cardinality constrained cycle and path polytopes
This page was built for publication: Polyhedral aspects of cardinality constrained combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3085160)
