Lower tolerance-based Branch and Bound algorithms for the ATSP.
Remco GermsBoris GoldengorinMarcel TurkensteenPublished in: Comput. Oper. Res. (2012)
Keyphrases
- branch and bound algorithm
- branch and bound
- lower bound
- upper bound
- randomly generated
- lower bounding
- optimal solution
- combinatorial optimization
- np hard
- search tree
- combinatorial problems
- variable ordering
- set covering problem
- max sat
- particle swarm optimization
- lower and upper bounds
- multi objective
- boolean satisfiability
- finding an optimal solution