Journal ArticleDOI
A parallel shortest augmenting path algorithm for the assignment problem
Reads0
Chats0
TLDR
A parallel version of the shortest augmenting path algorithm for the assignment problem, which was tested on a 14-processor Butterfly Plus computer, on problems with up to 900 million variables and the speedup obtained increases with problem size.Abstract:
: We describe a parallel version of the shortest augmenting path algorithm for the assignment problem. While generating the initial dual solution and partial assignment in parallel does not require substantive changes in the sequential algorithm, using several augmenting paths in parallel does require a new dual variable recalculation method. The parallel algorithm was tested on a 14-processor Butterfly Plus computer, on problems with up to 900 million variables. The speedup obtained increases with problem size. The algorithm was also embedded into a parallel branch and bound procedure for the traveling salesman problem on a directed graph, which was test on the Butterfly Plus on problems involving up to 7,500 cities. To our knowledge, these are the largest assignment problems and traveling salesman problems solved so far.read more
Citations
More filters
Proceedings ArticleDOI
On Coreference Resolution Performance Metrics
TL;DR: The paper proposes a Constrained Entity-Alignment F-Measure (CEAF) for evaluating coreference resolution and shows that the best alignment is a maximum bipartite matching problem which can be solved by the Kuhn-Munkres algorithm.
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.
Journal ArticleDOI
Parallel Branch-and-Branch Algorithms: Survey and Synthesis
TL;DR: A new characterization of branch-and-bound algorithms is given, which consists of isolating the performed operations without specifying any particular order for their execution.
Journal ArticleDOI
Minimizing variation of production rates in just-in-time systems: A survey☆
TL;DR: In the past several years, there has been growing interest in scheduling problems where jobs are penalized both for being early and for being tardy as mentioned in this paper, and a number of excellent surveys on these problems have appeared over the last four years.
Parallel branch-and-bound algorithms: survey and synthesis
TL;DR: In this paper, the authors present a detailed and up-to-date survey of the literature on parallel branch-and-bound algorithms, and synthesize previous work in this area and propose a new classification of parallel branch and bound algorithms, which is used to analyze the methods proposed in the literature.
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
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Jack Edmonds,Richard M. Karp +1 more
TL;DR: New algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum-cost flow problem are presented, and Dinic shows that, in a network with n nodes and p arcs, a maximum flow can be computed in 0 (n2p) primitive operations by an algorithm which augments along shortest augmenting paths.
Book
Data Structures and Network Algorithms
TL;DR: This paper presents a meta-trees tree model that automates the very labor-intensive and therefore time-heavy and therefore expensive process of manually selecting trees to grow in a graph.
Related Papers (5)
A shortest augmenting path algorithm for dense and sparse linear assignment problems
R. Jonker,A. Volgenant +1 more