Journal ArticleDOI
An augmenting path method for solving Linear Bottleneck Assignment problems
Ulrich Derigs,Uwe Zimmermann +1 more
Reads0
Chats0
TLDR
An efficient method for solving Linear Bottleneck Assignment problems is described, which starts with a heuristically determined partial assignment and shortest augmenting paths are constructed with the aid of a modification of the algorithm of Dijkstra.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.read more
Citations
More filters
Book ChapterDOI
Linear Assignment Problems and Extensions
Rainer E. Burkard,Eranda Çela +1 more
TL;DR: Assignment problems deal with the question how to assign n items to n machines (or workers) in the best possible way and an objective function modeling the ”best way” is modeled.
A Bibliography of Publications about the Fortran Programming Language: Part 1: 1956{1980
TL;DR: In this paper, the authors proposed a method to solve the problem: see [Cas89a] and http://www.s/0098-3500/116814.html
Journal ArticleDOI
Selected topics on assignment problems
TL;DR: This work surveys recent developments in the fields of bipartite matchings, linear sum assignment and bottleneck assignment problems and applications, multidimensional assignment problems, quadratic assignments problems, in particular lower bounds, special cases and asymptotic results.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
The Hungarian method for the assignment problem
TL;DR: This paper has always been one of my favorite children, combining as it does elements of the duality of linear programming and combinatorial tools from graph theory, and it may be of some interest to tell the story of its origin this article.
Journal ArticleDOI
On some techniques useful for solution of transportation network problems
TL;DR: An efficient algorithm for solving transportation problems that requires at most n3 additions and comparisons when applied to an n-by-n assignment problem, as compared with the theoretical upper bound proportional to n4 for the number of such operations required by currently available methods.
Journal ArticleDOI
Time‐minimizing transportation problems
Peter L. Hammer,Peter L. Hammer +1 more
TL;DR: A method is given for finding those solutions of a transportation problem which minimize the total time necessary for transporting goods from the suppliers to the consumers.
Journal ArticleDOI
Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
TL;DR: A test of an algorithm proposed for the bottleneck assignment problem against a “threshold” algorithm, and it is found that the latter is superior computationally.