Parallel algorithms for the assignment and minimum-cost flow problems
Includes bibliographical references (p. 8-9).
Other Authors: | Orlin, James B., 1953-. |
---|---|
Language: | eng |
Published: |
Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1992.
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/2418 |
Similar Items
-
A faster algorithm for finding the minimum cut in a graph
Published: (2003) -
New scaling algorithms for the assignment and minimum cycle mean problems
Published: (2003) -
A faster strongly polynomial minimum cost flow algorithm
Published: (2003) -
A faster strongly polynomial minimum cost flow algorithm
Published: (2003) -
Scale and scope effects on advertising agency costs
Published: (2003)