Parallel synchronous and asynchronous implementations of the auction algorithm
From MaRDI portal
Publication:1179221
DOI10.1016/S0167-8191(05)80062-6zbMath0737.68036OpenAlexW2038828004MaRDI QIDQ1179221
Dimitri P. Bertsekas, David A. Castanon
Publication date: 26 June 1992
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8191(05)80062-6
Related Items
The assignment problem revisited, Towards auction algorithms for large dense assignment problems, Distributed Linear Programming with Event-Triggered Communication, Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking, On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices, Parallel asynchronous label-correcting methods for shortest paths, Asynchronous gradient algorithms for a class of convex separable network flow problems, Geometry Helps to Compare Persistence Diagrams, Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple, Parallel Auction Algorithm for Bus Rescheduling, Algorithms and codes for dense assignment problems: The state of the art, A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique, Auction algorithms for network flow problems: A tutorial introduction, A forward/reverse auction algorithm for asymmetric assignment problems, A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem, Some aspects of parallel and distributed iterative algorithms - a survey, A generic auction algorithm for the minimum cost network flow problem, Parallel primal-dual methods for the minimum cost flow problem
