A Hierarchical Relaxations Lower Bound for the Capacitated Arc Routing Problem.
Anita AmbergStefan VoßPublished in: HICSS (2002)
Keyphrases
- lower bound
- upper bound
- lower and upper bounds
- branch and bound algorithm
- branch and bound
- optimal solution
- upper and lower bounds
- np hard
- worst case
- objective function
- linear programming relaxation
- coarse to fine
- cutting plane
- neural network
- lower bounding
- vc dimension
- hierarchical structure
- evolutionary algorithm
- competitive ratio