Towards auction algorithms for large dense assignment problems
From MaRDI portal
Publication:839685
DOI10.1007/s10589-007-9146-5zbMath1170.90463OpenAlexW2007538612MaRDI QIDQ839685
Publication date: 2 September 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9146-5
Related Items (4)
On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices ⋮ A heuristic for the time constrained asymmetric linear sum assignment problem ⋮ Clustering analysis of a dissimilarity: a review of algebraic and geometric representation ⋮ Discrete optimal transport: complexity, geometry and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Parallel synchronous and asynchronous implementations of the auction algorithm
- A computational analysis of the auction algorithm
- A forward/reverse auction algorithm for asymmetric assignment problems
- An efficient cost scaling algorithm for the assignment problem
- On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
- A new algorithm for the assignment problem
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
- Technical Note—A “Hard” Assignment Problem
- Parallel Asynchronous Hungarian Methods for the Assignment Problem
- A parallel shortest augmenting path algorithm for the assignment problem
- Reverse Auction and the Solution of Inequality Constrained Assignment Problems
- Construction heuristics for the asymmetric TSP.
This page was built for publication: Towards auction algorithms for large dense assignment problems
