Simple Bounds and Greedy Algorithms for Decomposing a Flow into a Minimal Set of Paths - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2008

Simple Bounds and Greedy Algorithms for Decomposing a Flow into a Minimal Set of Paths

Bénédicte Vatinlen
  • Fonction : Auteur
Fabrice Chauvet
  • Fonction : Auteur
Philippe Chrétienne
  • Fonction : Auteur
  • PersonId : 968920
Philippe Mahey

Résumé

Given arbitrary source and target nodes s, t and an s–t-flow defined by its flow-values on each arc of a network, we consider the problem of finding a decomposition of this flow with a minimal number of s–t-paths. This problem is issued from the engineering of telecommunications networks for which the task of implementing a routing solution consists in integrating a set of end-to-end paths. We show that this problem is NP-hard in the strong sense and give some properties of an optimal solution. We then propose upper and lower bounds for the number of paths in an optimal solution. Finally we develop two heuristics based on the properties of a special set of solutions called saturating solutions.

Dates et versions

hal-01185177 , version 1 (19-08-2015)

Identifiants

Citer

Bénédicte Vatinlen, Fabrice Chauvet, Philippe Chrétienne, Philippe Mahey. Simple Bounds and Greedy Algorithms for Decomposing a Flow into a Minimal Set of Paths. European Journal of Operational Research, 2008, 185 (3), pp.1390-1401. ⟨10.1016/j.ejor.2006.05.043⟩. ⟨hal-01185177⟩
32 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More