On three basic methods for solving bottleneck transportation problems

Ulrich Derigs

Naval Research Logistics Quarterly, 1982, vol. 29, issue 3, 505-515

Abstract: For solving transportation problems essentially three types of methods are known: primal methods, the Hungarian method and the shortest augmenting path method. In this paper we present the specialization of these approaches to the bottleneck transportation problem and report some computational experience.

Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/nav.3800290312

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:29:y:1982:i:3:p:505-515

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().