The biobjective minimum cost flow problem
Year of publication: |
2000
|
---|---|
Authors: | Sedeño-Noda, A. ; González-Martin, C. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 124.2000, 3, p. 591-600
|
Saved in:
Saved in favorites
Similar items by person
-
Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
Sedeño-Noda, A., (2006)
-
An O(nm log(U-n)) Time Maximum Flow Algorithm
Sedeño-Noda, A., (2000)
-
New efficient shortest path simplex algorithm : pseudo permanent labels instead of permanent labels
Sedeño-Noda, A., (2009)
- More ...