An augmenting path method for solving Linear Bottleneck Assignment problems

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1978 English Publisher:Springer Science and Business Media LLCJournal:Computing, volume 19, pages 285-295 (issn: 0010-485X, eissn: 1436-5057,

Copyright policy )

Authors: Ulrich Derigs; Uwe Zimmermann;

doi: 10.1007/bf02252026

An augmenting path method for solving Linear Bottleneck Assignment problems

- Summary
- Subjects
- Metrics

Abstract

An efficient method for solving Linear Bottleneck Assignment problems is described. The method starts with a heuristically determined partial assignment. Then 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

Extremal problems in graph theory, Software, source code, etc. for problems pertaining to operations research and mathematical programming, Numerical mathematical programming methods, Integer programming

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).	42
	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.	Top 10%
	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 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%