Circuits in extended formulations

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Quadratic diameter bounds for dual network flow polyhedra
On the diameter of partition polytopes and vertex-disjoint cycle cover
Extended formulations for polygons
Smallest compact formulation for the permutahedron
Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
Using separation algorithms to generate mixed integer model reformulations
Expressing combinatorial optimization problems by linear programs
Optimal partitions having disjoint convex and conic hulls
Disjunctive programming: Properties of the convex hull of feasible points
Representations and characterizations of vertices of bounded-shape partition polytopes
The hierarchy of circuit diameters and transportation polytopes
Efficient solutions for weight-balanced partitioning problems
Combinatorial bounds on nonnegative rank and extended formulations
An adaptive algorithm for vector partitioning
On the circuit diameter conjecture
A polyhedral model for enumeration and optimization over the set of circuits
On circuit diameter bounds via circuit imbalances
A short proof that the extension complexity of the correlation polytope grows exponentially
Circuit walks in integral polyhedra
Exponential lower bounds for polytopes in combinatorial optimization
On optimal weighted balanced clusterings: gravity bodies and power diagrams
Integer Programming
On the Circuit Diameter of Dual Transportation Polyhedra
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method
Smoothed analysis of algorithms
Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
On the foundations of linear and integer linear programming I
Lectures on Polytopes
The Matching Polytope has Exponential Extension Complexity
On the Circuit Diameter of Some Combinatorial Polytopes
A Polynomial Time Algorithm for Shaped Partition Problems
Good Clusterings Have Large Volume
Regular Matroids Have Polynomial Extension Complexity
A Friendly Smoothed Analysis of the Simplex Method
Constructing Clustering Transformations
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization
Extended formulations in combinatorial optimization