Parallel synchronous and asynchronous implementations of the auction algorithm
From MaRDI portal
Recommendations
Cited in
(19)- Auction algorithms for network flow problems: A tutorial introduction
- A generic auction algorithm for the minimum cost network flow problem
- Parallel primal-dual methods for the minimum cost flow problem
- Parallel shortest path auction algorithms
- A forward/reverse auction algorithm for asymmetric assignment problems
- A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem
- Parallel asynchronous label-correcting methods for shortest paths
- Asynchronous gradient algorithms for a class of convex separable network flow problems
- Algorithms and codes for dense assignment problems: The state of the art
- The assignment problem revisited
- Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking
- Distributed linear programming with event-triggered communication
- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
- Parallel Auction Algorithm for Bus Rescheduling
- Geometry helps to compare persistence diagrams
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
- Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple
- Some aspects of parallel and distributed iterative algorithms - a survey
- Towards auction algorithms for large dense assignment problems
This page was built for publication: Parallel synchronous and asynchronous implementations of the auction algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179221)
