Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/93845
Type: Artigo de evento
Title: A Branch-and-bound Algorithm For The Multi-stage Transmission Expansion Planning
Author: Asada E.N.
Carreno E.
Romero R.
Garcia A.V.
Abstract: This work presents a branch-and-bound algorithm to solve the multi-stage transmission expansion planning problem. The well known transportation model is employed, nevertheless the algorithm can be extended to hybrid models or to more complex ones such as the DC model. Tests with a realistic power system were carried out in order to show the performance of the algorithm for the expansion plan executed for different time frames. © 2005 IEEE.
Editor: 
Rights: fechado
Identifier DOI: 
Address: http://www.scopus.com/inward/record.url?eid=2-s2.0-27144488879&partnerID=40&md5=e883976608ffb5597f563054be76ecd7
Date Issue: 2005
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
2-s2.0-27144488879.pdf312.33 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.