Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies

DOI10.1007/S10898-023-01338-0MaRDI QIDQ6497049zbMATH OpenFDO

Authors D. Barth, Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser

Publication date 6 May 2024

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10898-023-01338-0

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Optimisation of electrical network configuration: complexity and algorithms for ring topologies
• Electrical flows over spanning trees
• Connectivity-and-hop-constrained design of electricity distribution networks
• A polynomial algorithm for deciding the validity of an electrical distribution tree
• The electrical distribution network planning problem

Cites work

• A polynomial algorithm for deciding the validity of an electrical distribution tree
• Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Optimisation of electrical network configuration: complexity and algorithms for ring topologies

This page was built for publication: Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6497049)