Simple extensions of polytopes
From MaRDI portal
Publication:896292
DOI10.1007/s10107-015-0885-2zbMath1432.52017arXiv1311.3470OpenAlexW2164572645MaRDI QIDQ896292
Matthias Walter, Volker Kaibel
Publication date: 9 December 2015
Published in: Mathematical Programming. Series A. Series B, Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.3470
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A counterexample to the Hirsch conjecture
- Smallest compact formulation for the permutahedron
- On the extension complexity of combinatorial polytopes
- Simple extensions of polytopes
- Approximate formulations for 0-1 knapsack sets
- Using separation algorithms to generate mixed integer model reformulations
- Expressing combinatorial optimization problems by linear programs
- Extreme points and adjacency relationship in the flow polytope
- Disjunctive programming: Properties of the convex hull of feasible points
- On certain polytopes associated with graphs
- Combinatorial bounds on nonnegative rank and extended formulations
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Some \(0/1\) polytopes need exponential size extended formulations
- A note on the extension complexity of the knapsack polytope
- Constructing Extended Formulations from Reflection Relations
- The travelling salesman problem and a class of polyhedra of diameter two
- Disjunctive Programming
- The Matching Polytope has Exponential Extension Complexity
- Symmetry Matters for Sizes of Extended Formulations
- Tight Lower Bounds on the Sizes of Symmetric Extensions of Permutahedra and Similar Results
- Linear vs. semidefinite extended formulations
This page was built for publication: Simple extensions of polytopes
