Hidden vertices in extensions of polytopes
From MaRDI portal
Publication:1785631
DOI10.1016/j.orl.2015.01.004zbMath1408.52020arXiv1404.2752OpenAlexW2009572235MaRDI QIDQ1785631
Kanstantsin Pashkovich, Stefan Weltge
Publication date: 1 October 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.2752
(n)-dimensional polytopes (52B11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (3)
Extended formulations for convex heptagons ⋮ The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract) ⋮ Tropical lower bound for extended formulations. II. Deficiency graphs of matrices
Cites Work
- Expressing combinatorial optimization problems by linear programs
- Polygons as sections of higher-dimensional polytopes
- An upper bound for nonnegative rank
- A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs
- Extended Formulations for Packing and Partitioning Orbitopes
- Symmetry Matters for Sizes of Extended Formulations
This page was built for publication: Hidden vertices in extensions of polytopes
