A Branch and Bound Algorithm for Transmission Network Expansion Planning Using Nonconvex Mixed-Integer Nonlinear Programming Models.
Reinaldo T. ZoppeiMarcos A. J. DelgadoLeonardo H. MacedoMarcos J. RiderRubén A. RomeroPublished in: IEEE Access (2022)
Keyphrases
- branch and bound algorithm
- mixed integer nonlinear programming
- mixed integer linear programming
- lower bound
- np hard
- upper bound
- branch and bound
- search algorithm
- probabilistic model
- combinatorial optimization
- nonlinear programming
- objective function
- worst case
- constraint satisfaction problems
- feasible solution
- lagrangian relaxation