A Branch-and-Cut Benders Decomposition Algorithm for Transmission Expansion Planning

Thumbnail Image

Files

Primary A_Branch-and-Cut_Benders_Decomposition_Algorithm_for_Transmission_Expansion_Planning.pdf (2.37 MB)

DOI

https://doi.org/10.7939/r3-fjvx-kz42

Date

2019-01-01

Author(s)

Shengjun Huang, Venkata Dinavahi

Citation for Previous Publication

Link to Related Item

Abstract

Item Type

http://purl.org/coar/resource_type/c_6501 http://purl.org/coar/version/c_970fb48d4fbd8a85

Title

A Branch-and-Cut Benders Decomposition Algorithm for Transmission Expansion Planning

Alternative

License

http://creativecommons.org/licenses/by-nc/4.0/

Other License Text / Link

Subject/Keywords

Benders decomposition (BD)
Branch-and-cut (B&C) algorithm
Mixed-integer linear programming (MILP)
Parallel processing
Security constrained transmission expansion planning (SCTEP)

Language

en

Location

Time Period

Source

Collections

Journal Articles (Electrical and Computer Engineering)