The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear programming. While transportation polytopes are at the core of operations research and statistics it is still unknown whether the Hirsch conjecture is true for general m×n-transportation polytopes. In earlier work the first three authors introduced a hierarchy of variations to the notion of graph diameter in polyhedra. This hierarchy provides some interesting lower bounds for the usual graph diameter.This paper has three contributions: First, we compare the hierarchy of diameters for the m×n-transportation polytopes. We show that the Hirsch conjecture bound of m+n−1 is actually valid in most of these diameter notions. Second, we prove that for 3×n-transportation polytopes the Hirsch conjecture holds in the classical graph diameter. Third, we show for 2×n-transportation polytopes that the stronger monotone Hirsch conjecture holds and improve earlier bounds on the graph diameter.
Discrete Applied Mathematics – Elsevier
Published: May 11, 2018
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera