Towards auction algorithms for large dense assignment problems (Q839685)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Towards auction algorithms for large dense assignment problems	scientific article

Statements

scholarly article

Towards auction algorithms for large dense assignment problems (English)

zbMATH Open document ID

10.1007/s10589-007-9146-5

Computational Optimization and Applications

publication date

2 September 2009

Mathematics Subject Classification ID

zbMATH DE Number

zbMATH Keywords

linear sum assignment problem

auction algorithm

linear optimization

distributed algorithms

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1007/s10589-007-9146-5

A parallel shortest augmenting path algorithm for the assignment problem

A forward/reverse auction algorithm for asymmetric assignment problems

A new algorithm for the assignment problem

Parallel synchronous and asynchronous implementations of the auction algorithm

Parallel Asynchronous Hungarian Methods for the Assignment Problem

Reverse Auction and the Solution of Inequality Constrained Assignment Problems

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

Construction heuristics for the asymmetric TSP.

An efficient cost scaling algorithm for the assignment problem

Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems

A shortest augmenting path algorithm for dense and sparse linear assignment problems

Technical Note—A “Hard” Assignment Problem

A computational analysis of the auction algorithm

Sitelinks

Mathematics(1 entry)

mardi Publication:839685

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q839685&oldid=35126082"