Pages that link to "Item:Q1179221"
From MaRDI portal
The following pages link to Parallel synchronous and asynchronous implementations of the auction algorithm (Q1179221):
Displaying 19 items.
- Some aspects of parallel and distributed iterative algorithms - a survey (Q805158) (← links)
- Towards auction algorithms for large dense assignment problems (Q839685) (← links)
- Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
- A generic auction algorithm for the minimum cost network flow problem (Q1315446) (← links)
- Parallel primal-dual methods for the minimum cost flow problem (Q1315451) (← links)
- Parallel shortest path auction algorithms (Q1339234) (← links)
- A forward/reverse auction algorithm for asymmetric assignment problems (Q1803649) (← links)
- A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem (Q1814992) (← links)
- Parallel asynchronous label-correcting methods for shortest paths (Q1908632) (← links)
- Asynchronous gradient algorithms for a class of convex separable network flow problems (Q1915768) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- The assignment problem revisited (Q2136890) (← links)
- Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking (Q2634668) (← links)
- Distributed Linear Programming with Event-Triggered Communication (Q3178441) (← links)
- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices (Q3466259) (← links)
- Parallel Auction Algorithm for Bus Rescheduling (Q3525429) (← links)
- Geometry Helps to Compare Persistence Diagrams (Q4577947) (← links)
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique (Q5131697) (← links)
- Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple (Q6116659) (← links)
