Polyhedral aspects of cardinality constrained combinatorial optimization problems
From MaRDI portal
Publication:3085160
Combinatorial optimization (90C27) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Paths and cycles (05C38)
Recommendations
Cited in
(10)- Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope
- Cardinality constrained combinatorial optimization: complexity and polyhedra
- Polyhedral techniques in combinatorial optimization II: applications and computations
- Lot-sizing polyhedra with a cardinality constraint
- On cardinality constrained cycle and path polytopes
- On the cardinality constrained matroid polytope
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
- Polyhedral techniques in combinatorial optimization I: Theory
- On cardinality constrained polymatroids
- Cardinality constraints and systems of restricted representatives
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)
