Tools
Tools
Balinski, M.L. (1983). The Hirsch Conjecture for Dual Transportation Polyhedra. IIASA Collaborative Paper. IIASA, Laxenburg, Austria: CP-83-009
Preview |
Text
CP-83-009.pdf Download (233kB) | Preview |
Abstract
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.
| Item Type: | Monograph (IIASA Collaborative Paper) |
|---|---|
| Research Programs: | System and Decision Sciences - Core (SDS) |
| Depositing User: | IIASA Import |
| Date Deposited: | 15 Jan 2016 01:54 |
| Last Modified: | 27 Aug 2021 17:11 |
| URI: | https://pure.iiasa.ac.at/2373 |
Actions (login required)
 |
View Item |