A Hybrid Branch-and-Bound and Benders Decomposition Algorithm for the Network Design Problem.
Saeed Asadi BagloeeMajid SarviMichael PatrikssonPublished in: Comput. Aided Civ. Infrastructure Eng. (2017)
Keyphrases
- decomposition algorithm
- network design problem
- branch and bound
- benders decomposition
- lower bound
- branch and bound algorithm
- search algorithm
- heuristic solution
- decomposition method
- column generation
- search space
- upper bound
- optimal solution
- combinatorial optimization
- lagrangian heuristic
- tree search
- network design
- max sat
- recognition algorithm
- approximation algorithms
- transportation networks
- np hard
- mixed integer
- neural network