The biobjective undirected two-commodity minimum cost flow problem
Year of publication: |
2005
|
---|---|
Authors: | Sedeño-Noda, A. ; González-Martín, C. ; Gutiérrez, J. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 164.2005, 1, p. 89-103
|
Saved in:
Saved in favorites
Similar items by person
-
New efficient shortest path simplex algorithm : pseudo permanent labels instead of permanent labels
Sedeño-Noda, A., (2009)
-
Sedeño-Noda, A., (2009)
-
Preemptive benchmarking problem: An approach for official statistics in small areas
Sedeño-Noda, A., (2009)
- More ...