Bounds for global optimization of capacity expansion and flow assignment problems
Year of publication: |
2000
|
---|---|
Authors: | Luna, H.P.L. ; Mahey, P. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 26.2000, 5, p. 211-216
|
Saved in:
Saved in favorites
Similar items by person
-
A Comparison of Optimal Methods for Local Access Uncapacitated Network Design
Randazzo, C.D., (2001)
-
A Survey of Algorithms for Convex Multicommodity Flow Problems
Ouorou, A., (2000)
-
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
Vatinlen, B., (2008)
- More ...