Pages that link to "Item:Q429646"
From MaRDI portal
The following pages link to Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646):
Displaying 19 items.
- Cardinality constraints and systems of restricted representatives (Q266031) (← links)
- On cardinality constrained polymatroids (Q496667) (← links)
- The location-dispatching problem: polyhedral results and content delivery network design (Q496706) (← links)
- Cardinality constrained and multicriteria (multi)cut problems (Q1013079) (← links)
- Lot-sizing polyhedra with a cardinality constraint (Q1198618) (← links)
- Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems (Q1324027) (← links)
- Cardinality constrained Boolean quadratic polytope (Q1372737) (← links)
- On the complexity of clustering with relaxed size constraints in fixed dimension (Q1704856) (← links)
- Multi-clustering via evolutionary multi-objective optimization (Q2195342) (← links)
- Dual consistent systems of linear inequalities and cardinality constrained polytopes (Q2340277) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- On the Complexity of Clustering with Relaxed Size Constraints (Q2830056) (← links)
- On cardinality constrained polymatroids (Q2861524) (← links)
- Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (Q2959185) (← links)
- On the cardinality constrained matroid polytope (Q3008918) (← links)
- Combinatorial flexibility problems and their computational complexity (Q3503571) (← links)
- Forbidden Vertices (Q5252224) (← links)
- The Complexity of Combinatorial Optimization Problems on <i>d</i>‐Dimensional Boxes (Q5454268) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
