A Branch-and-Bound Algorithm for Single-Row Routing.
Rong-Jaye ChenYu-Song HouPublished in: J. Inf. Sci. Eng. (1991)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- np hard
- optimal solution
- search tree
- lower bounding
- combinatorial optimization
- test problems
- precedence constraints
- upper bounding
- single machine scheduling problem
- branch and bound method
- randomly generated problems
- mixed integer linear programming
- finding an optimal solution
- lagrangian relaxation
- search algorithm
- variable ordering
- routing problem
- maximum clique
- integer variables
- routing protocol