On the geometric rank of matching polytope

DOI10.1007/S10107-014-0782-0MaRDI QIDQ494322zbMATH OpenOpenAlexFDO

Authors Ashwin Arulselvan

Publication date 31 August 2015

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-014-0782-0

zbMATH Keywords

facetsfactor critical graphsgeometric rankmatching polytope

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Recommendations

• On cutting-plane proofs in combinatorial optimization
• On matroid parity and matching polytopes
• Sherali-Adams relaxations of the matching polytope
• A note on the separation problem for the matching matroid
• Publication:3199198

Cites work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The rank of (mixed-) integer polyhedra

Cited in

(4)

• scientific article; zbMATH DE number 1475161 (Why is no real title available?)
• On the rank of Suzuki polytopes: an answer to Hubard and Leemans
• On the matrix-cut rank of polyhedra.
• scientific article; zbMATH DE number 7535269 (Why is no real title available?)

This page was built for publication: On the geometric rank of matching polytope

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