Add to ORKGNational audienceWe 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
© 2018 Dr Yahui SunSteiner tree problems in graphs, as a group of network optimization problems, are...
AbstractThe Steiner Forest Problem (SFP for short) is a natural generalization of the classical Stei...
The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning ...
National audienceWe show that a network design problem related to the optimization of the cabling of...
A wind farm is composed of wind turbines producing energy and cables used tocollect this energy and ...
We design combinatorial approximation algorithms for the Capacitated Steiner Network (Cap-SN) proble...
Many real-life problems boil down to a variant of the Minimum Steiner Tree Problem (STP). In telecom...
We design combinatorial approximation algorithms for the Capacitated Steiner Network (Cap-SN) proble...
We focus on designing combinatorial algorithms for the CAPACITATED NETWORK DESIGN problem (CAP-SNDP)...
Abstract. We study a network loading problem with applications in lo-cal access network design. Give...
Given a weighted graph G with n nodes and a unique root r, the Steinerarborescence problem is to fin...
We are interested in the design of robust (or resilient) capacitated rooted Steiner networks in case...
The Prize-Collecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks ...
The Prize-Collecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks ...
The smart grid is envisioned as a reconfigurable energy exchange network that is resilient to failu...
© 2018 Dr Yahui SunSteiner tree problems in graphs, as a group of network optimization problems, are...
AbstractThe Steiner Forest Problem (SFP for short) is a natural generalization of the classical Stei...
The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning ...
National audienceWe show that a network design problem related to the optimization of the cabling of...
A wind farm is composed of wind turbines producing energy and cables used tocollect this energy and ...
We design combinatorial approximation algorithms for the Capacitated Steiner Network (Cap-SN) proble...
Many real-life problems boil down to a variant of the Minimum Steiner Tree Problem (STP). In telecom...
We design combinatorial approximation algorithms for the Capacitated Steiner Network (Cap-SN) proble...
We focus on designing combinatorial algorithms for the CAPACITATED NETWORK DESIGN problem (CAP-SNDP)...
Abstract. We study a network loading problem with applications in lo-cal access network design. Give...
Given a weighted graph G with n nodes and a unique root r, the Steinerarborescence problem is to fin...
We are interested in the design of robust (or resilient) capacitated rooted Steiner networks in case...
The Prize-Collecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks ...
The Prize-Collecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks ...
The smart grid is envisioned as a reconfigurable energy exchange network that is resilient to failu...
© 2018 Dr Yahui SunSteiner tree problems in graphs, as a group of network optimization problems, are...
AbstractThe Steiner Forest Problem (SFP for short) is a natural generalization of the classical Stei...
The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning ...