Lower bounds for the mixed capacitated arc routing problem.
Luis Eduardo Neves GouveiaMaria Cândida MourãoLeonor Santiago PintoPublished in: Comput. Oper. Res. (2010)
Keyphrases
- lower bound
- upper bound
- lower and upper bounds
- branch and bound algorithm
- np hard
- objective function
- branch and bound
- optimal solution
- worst case
- upper and lower bounds
- quadratic assignment problem
- set of randomly generated instances
- lower bounding
- linear programming relaxation
- lagrangian relaxation
- neural network
- memetic algorithm
- randomly generated problems