A comparison of two algorithms for the assignment problem

DOI10.1007/BF01299157MaRDI QIDQ1804373zbMATH OpenFDO

Authors Hossam A. Zaki

Publication date 1 April 1996

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

zbMATH Keywords

linear assignment problemparallel computingauction algorithmshortest augmenting path

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• A parallel shortest augmenting path algorithm for the assignment problem
• scientific article; zbMATH DE number 515940
• Massively parallel augmenting path algorithms for the assignment problem
• The auction algorithm: A distributed relaxation method for the assignment problem

Cites work

• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• A new algorithm for the assignment problem
• 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
• An algorithm to solve them ×n assignment problem in expected timeO(mn logn)
• Dual coordinate step methods for linear network flow problems
• On some techniques useful for solution of transportation network problems
• Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8
• The auction algorithm: A distributed relaxation method for the assignment problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(9)

• Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8
• A forward/reverse auction algorithm for asymmetric assignment problems
• scientific article; zbMATH DE number 4090793 (Why is no real title available?)
• Simultaneous eating algorithm and greedy algorithm in assignment problems
• scientific article; zbMATH DE number 1482180 (Why is no real title available?)
• Computational Science and Its Applications – ICCSA 2004
• The assignment problem revisited
• The auction algorithm for assignment and other network flow problems
• Algorithms and codes for dense assignment problems: The state of the art

This page was built for publication: A comparison of two algorithms for the assignment problem

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