Cardinality constrained combinatorial optimization: complexity and polyhedra
From MaRDI portal
Publication:429646
DOI10.1016/J.DISOPT.2010.03.002zbMATH Open1241.90122OpenAlexW2112825959MaRDI QIDQ429646FDOQ429646
Publication date: 20 June 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2010.03.002
Recommendations
- Polyhedral aspects of cardinality constrained combinatorial optimization problems
- On the cardinality constrained matroid polytope
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Cardinality constraints and systems of restricted representatives
- A polyhedral study of the cardinality constrained knapsack problem
Cites Work
- polymake: a framework for analyzing convex polytopes
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Title not available (Why is that?)
- The Factorization of Linear Graphs
- On defining sets of vertices of the hypercube by linear inequalities
- Title not available (Why is that?)
- Maximum matching and a polyhedron with 0,1-vertices
- On the cut polytope
- Disjunctive programming: Properties of the convex hull of feasible points
- Matroids and the greedy algorithm
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- On cardinality constrained cycle and path polytopes
- Facets of the Bipartite Subgraph Polytope
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- Dual consistent systems of linear inequalities and cardinality constrained polytopes
- Combinatorial flexibility problems and their computational complexity
- On the Complexity of Clustering with Relaxed Size Constraints
- Cardinality minimization, constraints, and regularization: a survey
- Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems
- Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes
- Multi-clustering via evolutionary multi-objective optimization
- Cardinality constrained and multicriteria (multi)cut problems
- The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes
- On the complexity of clustering with relaxed size constraints in fixed dimension
- On cardinality constrained polymatroids
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- On cardinality constrained polymatroids
- The location-dispatching problem: polyhedral results and content delivery network design
- Lot-sizing polyhedra with a cardinality constraint
Uses Software
This page was built for publication: Cardinality constrained combinatorial optimization: complexity and polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429646)
