Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable

Authors:
Jesús A. De Loera;Steven Klee
Affiliations:
Department of Mathematics, University of California, Davis, California 95616;Department of Mathematics, University of California, Davis, California 95616
Venue:
Mathematics of Operations Research
Year:
2012

Citing 3
Cited 0

Polytopes, graphs and optimisation

Polytopes, graphs and optimisation
The d-step conjecture and its relatives

Mathematics of Operations Research
A Linear Bound On The Diameter Of The Transportation Polytope*

Combinatorica

Quantified Score

Hi-index	0.00

Visualization

Abstract

Provan and Billera defined the notion of weak k-decomposability for pure simplicial complexes in the hopes of bounding the diameter of convex polytopes. They showed the diameter of a weakly k-decomposable simplicial complex Δ is bounded above by a polynomial function of the number of k-faces in Δ and its dimension. For weakly 0-decomposable complexes, this bound is linear in the number of vertices and the dimension. In this paper we exhibit the first examples of non-weakly 0-decomposable simplicial polytopes. Our examples are in fact polar to certain transportation polytopes.