On the capacitated Steiner tree problem - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2015

On the capacitated Steiner tree problem


We show that a network design problem related to the optimization of the cabling of a wind energy farm can be modelled as a capacitated Steiner tree problem in graphs. Then, we give some hardness and polynomial-time solvability results concerning this graph problem, and finally we propose an approach based on integer linear programming to solve it in practice.
No file

Dates and versions

hal-01126602 , version 1 (06-03-2015)


  • HAL Id : hal-01126602 , version 1


Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, A. Hertz. On the capacitated Steiner tree problem. [Research Report] CEDRIC-15-3289, CEDRIC Lab/CNAM. 2015. ⟨hal-01126602⟩
52 View
0 Download


Gmail Facebook X LinkedIn More