Slack matrices, \(k\)-products, and 2-level polytopes
From MaRDI portal
Publication:6558684
DOI10.1016/J.DAM.2022.07.028zbMATH Open1548.90413MaRDI QIDQ6558684
Yuri Faenza, Marco Macchia, Manuel Aprile, Michele Conforti, Samuel Fiorini, Tony Huynh
Publication date: 20 June 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theta rank, levelness, and matroid minors
- Matroid polytopes, nested sets and Bergman fans
- Expressing combinatorial optimization problems by linear programs
- Minimizing symmetric submodular functions
- On certain polytopes associated with graphs
- Extension complexity of stable set polytopes of bipartite graphs
- Enumeration of 2-level polytopes
- Recognizing Cartesian products of matrices and polytopes
- Which nonnegative matrices are slack matrices?
- Extended formulations for matroid polytopes through randomized protocols
- On Vertices and Facets of Combinatorial 2-Level Polytopes
- Regular Matroids Have Polynomial Extension Complexity
- Lectures on matroids
- A Very General Theorem on Systems of Distinct Representatives
- Algorithm 457: finding all cliques of an undirected graph
- Extended formulations from communication protocols in output-efficient time
- Extended formulations in combinatorial optimization
This page was built for publication: Slack matrices, \(k\)-products, and 2-level polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6558684)
