Recognizing Cartesian products of matrices and polytopes

DOI10.1007/978-3-030-63072-0_28zbMath1483.15023arXiv2002.02264OpenAlexW3005352619MaRDI QIDQ2056923

Marco Macchia, Tony Huynh, Yuri Faenza, Michele Conforti, Manuel Aprile, Samuel Fiorini

Publication date: 8 December 2021

Full work available at URL: https://arxiv.org/abs/2002.02264

zbMATH Keywords

mutual informationCartesian productslack matrixsubmodular optimization2-level polytopes

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial optimization (90C27) Polyhedra and polytopes; regular figures, division of spaces (51M20) Basic linear algebra (15A99)

Related Items

Extended formulations for matroid polytopes through randomized protocols, Recognizing Cartesian products of matrices and polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The projected faces property and polyhedral relations
• Theta rank, levelness, and matroid minors
• Expressing combinatorial optimization problems by linear programs
• Minimizing symmetric submodular functions
• Recognizing Cartesian products of matrices and polytopes
• Which nonnegative matrices are slack matrices?
• On Vertices and Facets of Combinatorial 2-Level Polytopes
• Elements of Information Theory
• Extended formulations in combinatorial optimization