Symmetry Matters for Sizes of Extended Formulations
From MaRDI portal
Recommendations
- Uncapacitated flow-based extended formulations
- Extension complexity lower bounds for mixed-integer extended formulations
- A compact linear program for testing optimality of perfect matchings.
- Extended formulations in combinatorial optimization
- Extended formulations for radial cones
- Expressing combinatorial optimization problems by linear programs
- Extended formulations in combinatorial optimization
Cited in
(15)- Fooling sets and the spanning tree polytope
- Hidden vertices in extensions of polytopes
- Extended formulations for vertex cover
- Pitch, extension complexity, and covering problems
- Small extended formulations for cyclic polytopes
- On the combinatorial lower bound for the extension complexity of the spanning tree polytope
- Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes
- The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)
- An algebraic approach to symmetric extended formulations
- Symmetry matters for the sizes of extended formulations
- Lifting for simplicity: concise descriptions of convex sets
- Regular matroids have polynomial extension complexity
- Extension complexity of low-dimensional polytopes
- Tight lower bounds on the sizes of symmetric extensions of permutahedra and similar results
- Max-utility matchings with popularity via critical vertices
This page was built for publication: Symmetry Matters for Sizes of Extended Formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899066)
