A new strategy for the undirected two-commodity maximum flow problem
A. Sedeño-Noda
Primary Author
C. González-Martín
Additional Author
S. Alonso-Rodríguez
Additional Author
mixed material
bibliography
Netherlands
Springer Netherlands
0
monographic
en
English
17p
Computational Optimization and Applications
We address the two-commodity maximum flow problem on undirected
networks. As a result of a change of variables, we introduce a new formulation
that solves the problem through classical maximum flow techniques with only onecommodity.
Therefore, a general strategy, based on this change of variables, is defined
to deal with other undirected multi-commodity problems. Finally, we extend the single
objective problem to a bicriteria environment. We show that the set of efficient
solutions of the biobjective undirected two-commodity maximum flow problem is
the set of alternative optimum solutions of the undirected two-commodity maximum
flow problem. In addition, we prove that the set of efficient extreme points in the
objective space has, at most, cardinality two.
09266003
Portal Perguruan Tinggi
EJ00004
My Library
24
2010-05-20 15:54:49
2010-05-20 15:55:11
machine generated