A Branch-and-Bound Algorithm to Solve a Multi-level Network Optimization Problem.
Frederico R. B. CruzGeraldo Robson MateusJames MacGregor SmithPublished in: J. Math. Model. Algorithms (2003)
Keyphrases
- branch and bound algorithm
- mixed integer linear programming
- combinatorial optimization
- branch and bound
- lower bound
- finding an optimal solution
- upper bound
- optimal solution
- lower bounding
- test problems
- integer variables
- np hard
- mathematical programming
- optimization algorithm
- network structure
- optimization problems
- weighted max sat
- lagrangian relaxation
- randomly generated problems
- precedence constraints
- variable ordering
- single machine scheduling problem
- neural network
- search algorithm
- metaheuristic
- search space
- network design problem
- max sat
- network design
- upper bounding
- strongly np hard
- branch and bound method
- evolutionary algorithm