Dual consistent systems of linear inequalities and cardinality constrained polytopes

DOI10.1007/978-3-642-32147-4_15MaRDI QIDQ3167621zbMATH OpenOpenAlexFDO

Authors Satoru Fujishige, Jens Maßberg

Publication date 2 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32147-4_15

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Dual consistent systems of linear inequalities and cardinality constrained polytopes
• Dual greedy polyhedra, choice functions, and abstract convex geometries
• On the cardinality constrained matroid polytope
• On cardinality constrained polymatroids
• On cardinality constrained polymatroids

Cited in

(4)

• Multilinear sets with two monomials and cardinality constraints
• Dual consistent systems of linear inequalities and cardinality constrained polytopes
• Dual greedy polyhedra, choice functions, and abstract convex geometries
• scientific article; zbMATH DE number 609980 (Why is no real title available?)

This page was built for publication: Dual consistent systems of linear inequalities and cardinality constrained polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167621)