Cardinality constrained combinatorial optimization: complexity and polyhedra

DOI10.1016/j.disopt.2010.03.002zbMath1241.90122OpenAlexW2112825959MaRDI QIDQ429646

Rüdiger Stephan

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

zbMATH Keywords

valid inequalitiescut polytopecardinality constraintsmatroidal relaxation

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (7)

Multi-clustering via evolutionary multi-objective optimization ⋮ On the complexity of clustering with relaxed size constraints in fixed dimension ⋮ On cardinality constrained polymatroids ⋮ The location-dispatching problem: polyhedral results and content delivery network design ⋮ Unnamed Item ⋮ On the Complexity of Clustering with Relaxed Size Constraints ⋮ Dual consistent systems of linear inequalities and cardinality constrained polytopes

Uses Software

• polymake

Cites Work

• On cardinality constrained cycle and path polytopes
• On defining sets of vertices of the hypercube by linear inequalities
• Disjunctive programming: Properties of the convex hull of feasible points
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• Facets of the Bipartite Subgraph Polytope
• On the cut polytope
• Maximum matching and a polyhedron with 0,1-vertices
• Matroids and the greedy algorithm
• The Factorization of Linear Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cardinality constrained combinatorial optimization: complexity and polyhedra