2019
DOI: 10.1016/j.compchemeng.2019.02.002
|View full text |Cite
|
Sign up to set email alerts
|

The synthesis problem of decentralized energy systems is strongly NP-hard

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 34 publications
(17 citation statements)
references
References 25 publications
0
13
0
Order By: Relevance
“…Energy sector related issues, which are often NP‐hard (Goderbauer et al. 2019), seem to be the most frequently represented subjects in publications on CO, with the keywords power and energy . The topic of power is mainly about the above‐mentioned smart grid (e.g., Meskina et al., 2018) applications or optimal power flow (e.g., Abido, 2002) calculations.…”
Section: Resultsmentioning
confidence: 99%
“…Energy sector related issues, which are often NP‐hard (Goderbauer et al. 2019), seem to be the most frequently represented subjects in publications on CO, with the keywords power and energy . The topic of power is mainly about the above‐mentioned smart grid (e.g., Meskina et al., 2018) applications or optimal power flow (e.g., Abido, 2002) calculations.…”
Section: Resultsmentioning
confidence: 99%
“…ESIP problems can be very challenging to solve, they are usually NP‐hard. In Reference 101, authors show that the synthesis problem (ie, the investment problem) of decentralized energy systems is strongly NP‐hard. Some papers reviewed focus on computational issues and propose alternative approaches.…”
Section: Survey Of Optimization Methods For Energy System Planningmentioning
confidence: 99%
“…10 10 ). Goderbauer et al [44] recently formalised the complexity of MINLP energy system problems as N P − Hard but did not discuss MILP problems. In fact, model complexity is rarely formalised.…”
Section: Side Note On Tractability Of Optimisation Modelsmentioning
confidence: 99%