Abstract
This paper presents a zero-one implicit enumeration method applied to an integer programming subproblem which has to be solved as part of a more general process of obtaining an optimal solution for a transmission expansion planning problem by hierarchical Benders decomposition. The proposed algorithm has been successfully implemented and tested in a real-life system. The reasons why the implicit enumeration approach is particularly suited for the static expansion planning problem are fully discussed in the paper. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
