The Hirsch Conjecture for Dual Transportation Polyhedra

Published Online:https://doi.org/10.1287/moor.9.4.629

An algorithm is given that joins any pair of extreme points of a dual transportation polyhedron by a path of at most (m − 1)(n − 1) extreme edges.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.