Relaxation methods for minimum cost ordinary and generalized network flow problems
Title from cover.
Other Authors: | Bertsekas, Dimitri P. |
---|---|
Language: | eng |
Published: |
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/2882 |
Similar Items
-
RELAX-IV : a faster version of the RELAX code for solving minimum cost flow problems
Published: (2003) -
An E-relaxation method for separable convex cost generalized network flow problems
Published: (2003) -
The auction algorithm for the minimum cost network flow problem
Published: (2003) -
RELAX: a computer code for minimum cost network flow problems
Published: (2003) -
An e-relaxation method for separable convex cost network flow problems
Published: (2003)