Extended Formulations for Radial Cones

05/25/2018
by   Matthias Walter, et al.
0

This paper studies extended formulations for radial cones at vertices of polyhedra, where the radial cone of a polyhedron P at a vertex v ∈ P is the polyhedron defined by the constraints of P that are active at v . Given an extended formulation for P , it is easy to obtain an extended formulation of comparable size for each its radial cones. On the contrary, it is possible that radial cones of P admit much smaller extended formulations than P itself. A prominent example of this type is the perfect-matching polytope, which cannot be described by subexponential-size extended formulations (Rothvoß 2014). However, Ventura & Eisenbrand (2003) showed that its radial cones can be described by polynomial-size extended formulations. Moreover, they generalized their construction to V -join polyhedra. In the same paper, the authors asked whether the same holds for the odd-cut polyhedron, the blocker of the V -join polyhedron. We answer this question negatively. Precisely, we show that radial cones of odd-cut polyhedra cannot be described by subexponential-size extended formulations. To obtain our result, for a polyhedron P of blocking type, we establish a general relationship between its radial cones and certain faces of the blocker of P .

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2021

Extended formulations for matroid polytopes through randomized protocols

Let P be a polytope. The hitting number of P is the smallest size of a h...
research
11/20/2018

Extended formulations from communication protocols in output-efficient time

Deterministic protocols are well-known tools to obtain extended formulat...
research
08/29/2018

Level Planarity: Transitivity vs. Even Crossings

Recently, Fulek et al. have presented Hanani-Tutte results for (radial) ...
research
09/15/2023

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization

With the goal of obtaining strong relaxations for binary polynomial opti...
research
04/19/2021

New formulations and branch-and-cut procedures for the longest induced path problem

Given an undirected graph G=(V,E), the longest induced path problem (LIP...
research
08/24/2020

An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings

An ortho-radial grid is described by concentric circles and straight-lin...
research
06/10/2021

A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing

Orthogonal drawings, i.e., embeddings of graphs into grids, are a classi...

Please sign up or login with your details

Forgot password? Click here to reset