Towards auction algorithms for large dense assignment problems

DOI10.1007/S10589-007-9146-5MaRDI QIDQ839685zbMATH OpenOpenAlexFDO

Authors Libor Buš, Pavel Tvrdík

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

zbMATH Keywords

auction algorithmdistributed algorithmslinear optimizationlinear sum assignment problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The auction algorithm: A distributed relaxation method for the assignment problem
• The auction algorithm for assignment and other network flow problems
• The assignment problem revisited
• A computational analysis of the auction algorithm
• scientific article; zbMATH DE number 515937

Cites work

• A computational analysis of the auction algorithm
• A forward/reverse auction algorithm for asymmetric assignment problems
• 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 efficient cost scaling algorithm for the assignment problem
• Construction heuristics for the asymmetric TSP.
• scientific article; zbMATH DE number 6118218 (Why is no real title available?)
• scientific article; zbMATH DE number 3932819 (Why is no real title available?)
• scientific article; zbMATH DE number 53116 (Why is no real title available?)
• scientific article; zbMATH DE number 1239298 (Why is no real title available?)
• scientific article; zbMATH DE number 515937 (Why is no real title available?)
• scientific article; zbMATH DE number 515938 (Why is no real title available?)
• scientific article; zbMATH DE number 515940 (Why is no real title available?)
• On algorithms for permuting large entries to the diagonal of a sparse matrix
• On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
• Parallel Asynchronous Hungarian Methods for the Assignment Problem
• Parallel synchronous and asynchronous implementations of the auction algorithm
• Reverse Auction and the Solution of Inequality Constrained Assignment Problems
• Technical Note—A “Hard” Assignment Problem
• Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems

Cited in

(7)

• A forward/reverse auction algorithm for asymmetric assignment problems
• The assignment problem revisited
• Discrete optimal transport: complexity, geometry and applications
• On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
• A heuristic for the time constrained asymmetric linear sum assignment problem
• Auction/Belief Propagation Algorithms for Constrained Assignment Problem
• Clustering analysis of a dissimilarity: a review of algebraic and geometric representation

This page was built for publication: Towards auction algorithms for large dense assignment problems

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