Transmission system expansion planning by a branch-and-bound algorithm
By Marcos J. Rider, Ariovaldo V. Garcia, Rubén R. Romero. 2008
98 citations recorded by the source corpus.
Subfields: Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/4cb7a31ffe78b91fc30168ed5eabf67708fb2f6a
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
- Marcos J. Rider
- Mohsen Rahmani
- Rubén R. Romero
- G. Vinasco
- Rabih A. Jabr
- John F. Franco
- Marina Lavorato
- Alberto Borghetti
Citations in the corpus
- Strategies to Reduce the Number of Variables and the Combinatorial Search Space of the Multistage Transmission Expansion Planning Problem (2013, methodology): “Some examples are: classical methods [3], [4] heuristic algorithms [5], [6], meta-heuristic strategies [2], [7], [8]–[10] relaxed mathematical models [11], [12] and hybrid methods [13], [14].”
- A Strategy to Solve the Multistage Transmission Expansion Planning Problem (2011, methodology): “The mathematical models used for the static and multistage TEP problems are presented in [1], [2] and [3], [4], respectively.”