Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm.
Mohamed HaouariJouhaina ChaouachiMoshe DrorPublished in: J. Oper. Res. Soc. (2005)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- finding an optimal solution
- lower bound
- variable ordering
- branch and bound
- upper bound
- lower bounding
- randomly generated
- search tree
- test problems
- integer variables
- optimal solution
- upper bounding
- np hard
- single machine scheduling problem
- precedence constraints
- branch and bound method
- traveling salesman problem
- optimization problems
- lagrangian relaxation
- maximum clique
- mixed integer linear programming
- strongly np hard
- weighted max sat
- exact methods
- randomly generated problems
- search algorithm
- computational complexity
- metaheuristic
- max sat
- lower and upper bounds
- scheduling problem
- feasible solution
- objective function
- simulated annealing