Modelling the power supply network -- hardness and approximation
From MaRDI portal
Publication:4922115
Recommendations
Cited in
(15)- A heuristic method for solving the problem of partitioning graphs with supply and demand
- Strong NP-hardness of AC power flows feasibility
- scientific article; zbMATH DE number 5138348 (Why is no real title available?)
- Computational challenges in electrical power networks
- Power Approximation for Computing (s, S) Policies Using Service Level
- Partitioning of supply/demand graphs with capacity limitations: an ant colony approach
- Approximability of partitioning graphs with supply and demand
- Approximability of Partitioning Graphs with Supply and Demand
- Parameterized Minimum Cost Partition of a Tree with Supply and Demand
- The impact of distribution system characteristics on computational tractability
- Solvability of the power flow problem in DC overhead wire circuit modeling.
- A heuristic approach for dividing graphs into bi-connected components with a size constraint
- Partition on trees with supply and demand: kernelization and algorithms
- A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs
- a generalized network flow model with application to power supply-demand problems
This page was built for publication: Modelling the power supply network -- hardness and approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922115)