Parallel primal-dual methods for the minimum cost flow problem
"This report is a substantial revision of report LIDS-P-1998, September 1990."
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/3284 |
Similar Items
Similar Items
-
Parallel asynchronous primal-dual methods for the minimum cost flow problem
Published: (2003) -
A unified framework for primal-dual methods in minimum cost network flow problems
Published: (2003) -
Relaxation methods for minimum cost ordinary and generalized network flow problems
Published: (2003) -
The auction algorithm for the minimum cost network flow problem
Published: (2003) -
A generic auction algorithm for the minimum cost network flow problem
Published: (2003)