A new strategy for the undirected two-commodity maximum flow problem
Year of publication: |
2010
|
---|---|
Authors: | Sedeño-Noda, A. ; González-Martín, C. ; Alonso-Rodríguez, S. |
Published in: |
Computational Optimization and Applications. - Springer. - Vol. 47.2010, 2, p. 289-305
|
Publisher: |
Springer |
Subject: | Two-commodity flow | Two-commodity maximum flow | Biobjective two-commodity maximum flow |
-
Improved branch-and-cut for the Inventory Routing Problem based on a two-commodity flow formulation
Manousakis, Eleftherios, (2021)
-
The cyclic production routing problem
Manousakis, Eleftherios G., (2023)
- More ...
-
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 ...