Cardinality constrained combinatorial optimization: complexity and polyhedra
type: Item
instance of: scholarly article
title: Cardinality constrained combinatorial optimization: complexity and polyhedra
zbMATH Open document ID: 1241.90122
author: Rüdiger Stephan
published in: Discrete Optimization
publication date: 2012-06-20T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6048230
zbMATH Keywords: cardinality constraints
zbMATH Keywords: valid inequalities
zbMATH Keywords: matroidal relaxation
zbMATH Keywords: cut polytope
describes a project that uses: polymake
MaRDI profile type: Publication
full work available at URL: j.disopt.2010.03.002
OpenAlex ID: W2112825959
cites work: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
cites work: On cardinality constrained cycle and path polytopes
cites work: On defining sets of vertices of the hypercube by linear inequalities
cites work: Q4134510
cites work: Q3665799
cites work: Q5465112
cites work: Q4198056
cites work: Matroids and the greedy algorithm
cites work: polymake: a framework for analyzing convex polytopes
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
cites work: Q3258698
cites work: The Factorization of Linear Graphs
cites work: Formulations and valid inequalities of the node capacitated graph partitioning problem
cites work: On the cut polytope
cites work: Facets of the Bipartite Subgraph Polytope
cites work: Disjunctive programming: Properties of the convex hull of feasible points
DOI: 10.1016/J.DISOPT.2010.03.002
description: scientific article; zbMATH DE number 6048230