Boolean quadric polytopes are faces of linear ordering polytopes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3659595 (Why is no real title available?)
- scientific article; zbMATH DE number 202575 (Why is no real title available?)
- scientific article; zbMATH DE number 6745104 (Why is no real title available?)
- A new proof of Gromov’s theorem on groups of polynomial growth
- A short proof that the extension complexity of the correlation polytope grows exponentially
- An analog of the Cook theorem for polytopes
- Exponential lower bounds for polytopes in combinatorial optimization
- Geometry of cuts and metrics
- How to recycle your facets
- Reducibility among combinatorial problems
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation
- \(\Phi\)-harmonic functions on discrete groups and the first \(\ell^\Phi\)-cohomology
- \(k\)-neighborly faces of the Boolean quadric polytopes
Cited in
(4)
This page was built for publication: Boolean quadric polytopes are faces of linear ordering polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2403680)