Work

On the Circuit Diameter of Dual Transportation Polyhedra

Year: 2015
Type: article
Abstract: 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{\times}N$ bipartite graphs the Hirsch bound (M-1)(N-1) on the combinatorial diameter is a known tight bound [Math. Oper. Res., 9 (1984), pp. 629--633]. 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.
Language: English
Open Access status: green
OpenAlex ID: W2005199701
FWCI: 2.126
Cites: 15
Cited by: 41
Related to: 10