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

DOI10.1007/BF00247794zbMath0858.90127MaRDI QIDQ1814992

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

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

Related Items (1)

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

Uses Software

• MPL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The auction algorithm for the transportation problem
• Solution of large dense transportation problems using a parallel primal algorithm
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Parallel synchronous and asynchronous implementations of the auction algorithm
• The auction algorithm: A distributed relaxation method for the assignment problem
• Data parallel computing for network-structured optimization problems
• Massively parallel augmenting path algorithms for the assignment problem
• A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem
• A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
• An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
• Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8
• A network simplex method
• The alternating basis algorithm for assignment problems
• Parallel Asynchronous Hungarian Methods for the Assignment Problem
• A parallel shortest augmenting path algorithm for the assignment problem

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