 
[LBE15] On the minimum convex cost multicast flow problemConférence Internationale avec comité de lecture : INOC, May 2015, pp.18, Poland,Mots clés: Multicast, convex cost, nonlinear programming, gradient projection method
Résumé:
In this paper, we define and study the minimum convex cost multicast flow problem. The
multicast framework refers to the ability for any node of a telecommunication network
to replicate its received information instead of only forwarding it. Given such a network
with a prescribed set of terminals and a cost function on each edge, the minimum convex
cost multicast flow problem amounts to finding a routing scheme ensuring a given demand
between all terminals while coping with capacity requirement on each edge and minimizing
the overall routing cost induced by the convex edge cost function. This problem can be
regarded as a generalization of the wellstudied minimum convex cost flow problem where
paths between two terminals at a time are replaced by Steiner trees spanning all terminals.
We propose a heuristic approach based on the gradient projection method to solve the
minimum convex cost multicast flow problem.
Equipe:
oc
Collaboration:
BibTeX

