An augmenting path method for solving Linear Bottleneck Transportation problems

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1979 English Publisher:Springer Science and Business Media LLCJournal:Computing, volume 22, pages 1-15 (issn: 0010-485X, eissn: 1436-5057,

Copyright policy )

Authors: Ulrich Derigs; Uwe Zimmermann;

doi: 10.1007/bf02246556

An augmenting path method for solving Linear Bottleneck Transportation problems

- Summary
- Subjects
- Metrics

Abstract

An efficient method for solving Linear Bottleneck Transportation problems is described. The method starts with a heuristically determined lower bound for the optimal value. Shortest augmenting paths are constructed with the aid of a modification of the algorithm of Dijkstra. Comprehensive numerical investigations are reported and discussed. A FORTRAN IV subroutine can be found in the appendix.

Related Organizations

University of Cologne
Germany

Keywords

Numerical mathematical programming methods, Linear programming, Deterministic network models in operations research, Programming involving graphs or networks, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	19
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%