Accelerating the Benders decomposition for network-constrained unit commitment problems
By Lei Wu, Mohammad Shahidehpour. 2010
102 citations recorded by the source corpus.
Subfields: Electrical and Electronic Engineering, Safety, Risk, Reliability and Quality
View Paper: https://www.semanticscholar.org/paper/30879e773389d97318153c5b3e466ae877c94a2a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Electrical and Electronic Engineering
- Zuyi Li
- Mohammad Shahidehpour
- Hongyu Wu
- Mohammad E. Khodayar
- Wei Tian
- Rafal Weron
- Antonio J. Conejo
- Lei Wu
In Safety, Risk, Reliability and Quality
- Hongyu Wu
- Zuyi Li
- Mohammad E. Khodayar
- Wei Tian
- Mohammad Shahidehpour
- Rafal Weron
- Adam Misiorek
- Antonio J. Conejo
Citations in the corpus
- Hourly Demand Response in Day-Ahead Scheduling Considering Generating Unit Ramping Cost (2013, methodology): “2) Making use of the specific structure of day-ahead scheduling problem, acceleration strategies would be employed to reduce the problem size [32] or accelerate the convergence [33].”
- Chance-Constrained Day-Ahead Scheduling in Stochastic Power System Operation (2014, methodology): “A corrective dispatch [21], [23] is also considered in which the committed generation capacity will be re-dispatched within the allowable range (13):”