Modelling the power supply network -- hardness and approximation
DOI10.1007/978-3-642-38236-9_7zbMATH Open1382.68332OpenAlexW2150793317MaRDI QIDQ4922115FDOQ4922115
Authors: Alexandru Popa 
Publication date: 28 May 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38236-9_7
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
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
- Title not available (Why is that?)
- 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 generalized network flow model with application to power supply-demand problems
- A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs
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)
