Polyhedral aspects of cardinality constrained combinatorial optimization problems
zbMATH Open1213.90006MaRDI QIDQ3085160FDOQ3085160
Authors: Rüdiger Stephan 
Publication date: 29 March 2011
Full work available at URL: http://opus.kobv.de/tuberlin/volltexte/2009/2401/
Recommendations
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)
Cited In (10)
- Cardinality constraints and systems of restricted representatives
- 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
- Polyhedral techniques in combinatorial optimization I: Theory
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
- On cardinality constrained polymatroids
- On cardinality constrained cycle and path polytopes
- On the cardinality constrained matroid polytope
- Lot-sizing polyhedra with a cardinality constraint
Uses Software
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)
