[Episilon]-relaxation and auction algorithms for the convex cost network flow problem
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
Main Author: | Plymenakos, Lazaros C. (Lazaros Christos) |
---|---|
Other Authors: | Dimitri P. Bertsekas. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2007
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/36563 |
Similar Items
-
Analysis of parallel asynchronous schemes for the auction shortest path algorithm
by: Polymenakos, Lazaros
Published: (2005) -
E-relaxation and auction method for separable convex cost network flow problems
Published: (2003) -
Relaxation methods for network flow problems with convex arc costs
Published: (2003) -
An e-relaxation method for separable convex cost network flow problems
Published: (2003) -
On network flow problems with convex cost
by: Nguyen, V.A., et al.
Published: (2004)