Power transmission network expansion planning: A semidefinite programming branch-and-bound approach
- 1 May 2019
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 274 (3) , 837-844
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Natural Sciences and Engineering Research Council of Canada (RGPIN-2017-04185)
This publication has 31 references indexed in Scilit:
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completionMathematical Programming, 2010
- Power system transmission network expansion planning using AC modelIET Generation, Transmission & Distribution, 2007
- Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planningIET Generation, Transmission & Distribution, 2007
- Multistage and Coordinated Planning of the Expansion of Transmission SystemsIEEE Transactions on Power Systems, 2004
- A new Benders decomposition approach to solve power transmission network design problemsIEEE Transactions on Power Systems, 2001
- Transmission network expansion planning under a Tabu Search approachIEEE Transactions on Power Systems, 2001
- Specialised branch-and-bound algorithm for transmission network expansion planningIEE Proceedings - Generation, Transmission and Distribution, 2001
- A mixed integer disjunctive model for transmission network expansionIEEE Transactions on Power Systems, 2001
- Branch and bound algorithm for transmission system expansion planning using a transportation modelIEE Proceedings - Generation, Transmission and Distribution, 2000
- Transmision system expansion planning by an extended genetic algorithmIEE Proceedings - Generation, Transmission and Distribution, 1998