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.>
No takes yet. Share an insight, caveat, or question.
Romero et al. (1994) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: