| Article ID: | iaor1991303 |
| Country: | United States |
| Volume: | 20 |
| Issue: | 4 |
| Start Page Number: | 133 |
| End Page Number: | 149 |
| Publication Date: | Jul 1990 |
| Journal: | Interfaces |
| Authors: | Bertsekas Dimitri P. |
| Keywords: | programming: network, graphs |
The auction algorithm is an intuitive method for solving the classical assignment problem. It outperforms substantially its main competitors for important types of problems, both in theory and in practice and is also naturally well suited for parallel computation. The paper derives the algorithm from first principles, explains its computational properties, and discusses its extensions to transportation and transshipment problems.