Mathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flow
Includes bibliographical references (p. 16-17).
Other Authors: | Bertsekas, Dimitri P. |
---|---|
Language: | eng |
Published: |
Massachusetts Institute of Technology, Laboratory for Information and Decision Systems]
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/3292 |
Similar Items
Similar Items
-
The auction algorithm : a distributed relaxation method for the assignment problem
Published: (2003) -
E-relaxation and auction method for separable convex cost network flow problems
Published: (2003) -
The auction algorithm for assignment and other network flow problems
Published: (2003) -
A forward/reverse auction algorithm for asymmetric assignment problems
Published: (2003) -
The auction algorithm for the minimum cost network flow problem
Published: (2003)