On the Circuit Diameter of Dual Transportation Polyhedra
On the Circuit Diameter of Dual Transportation Polyhedra
复制标题
关于双传输多面体的电路直径
DOI:
--
复制
发表时间:
2014
影响因子:
0.8
通讯作者:
R. Hemmecke
中科院分区:
文献类型:
--
作者:
S. Borgwardt;E. Finhold;R. Hemmecke
In this paper we introduce the circuit diameter of polyhedra, which is always bounded from above by the combinatorial diameter. We consider dual transportation polyhedra defined on general bipartite graphs. For complete $M{ imes}N$ bipartite graphs the Hirsch bound $(M{-}1)(N{-}1)$ on the combinatorial diameter is a known tight bound (Balinski, 1984). For the circuit diameter we show the much stronger bound $M{+}N{-}2$ for all dual transportation polyhedra defined on arbitrary bipartite graphs with $M{+}N$ nodes.