A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem

DOI10.1007/BF00247794MaRDI QIDQ1814992zbMATH OpenFDO

Authors Olof Damberg, Sverre Storøy, Tor Sørevik

Publication date 23 March 1997

Published in Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

bipartite matchingsemi-assignmentdata parallel primal-dual augmenting path algorithmdense linear many-to-one assignment problemparallel SIMD computers

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Recommendations

• Massively parallel augmenting path algorithms for the assignment problem
• A parallel shortest augmenting path algorithm for the assignment problem
• A comparison of two algorithms for the assignment problem
• scientific article; zbMATH DE number 515940

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• scientific article; zbMATH DE number 3670204 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
• A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem
• A network simplex method
• A parallel shortest augmenting path algorithm for the assignment problem
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
• Data parallel computing for network-structured optimization problems
• Massively parallel augmenting path algorithms for the assignment problem
• Parallel Asynchronous Hungarian Methods for the Assignment Problem
• Parallel synchronous and asynchronous implementations of the auction algorithm
• Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8
• Solution of large dense transportation problems using a parallel primal algorithm
• The alternating basis algorithm for assignment problems
• The auction algorithm for the transportation problem
• The auction algorithm: A distributed relaxation method for the assignment problem

Cited in

(2)

• A parallel shortest augmenting path algorithm for the assignment problem
• A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem

Describes a project that uses

Uses Software

• MPL

This page was built for publication: A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814992)