New lower bound for the Capacitated Arc Routing Problem.
Sanne WøhlkPublished in: Comput. Oper. Res. (2006)
Keyphrases
- lower bound
- upper bound
- lower and upper bounds
- branch and bound algorithm
- branch and bound
- optimal solution
- np hard
- objective function
- lagrangian relaxation
- lower bounding
- worst case
- upper and lower bounds
- cutting plane
- traveling salesman problem
- data structure
- linear programming relaxation
- competitive ratio
- randomized algorithm