On the capacitated Steiner tree problem
Résumé
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.