Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem.
Ricardo FukasawaLaurent PoirrierPublished in: INFORMS J. Comput. (2017)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- capacity constraints
- metaheuristic
- memetic algorithm
- objective function
- lower and upper bounds
- vehicle routing problem
- optimal solution
- lagrangian relaxation
- np hard
- ant colony optimization
- vc dimension
- upper and lower bounds
- worst case
- scatter search
- quadratic assignment problem
- lower bounding
- set of randomly generated instances
- image registration
- concept class
- online algorithms
- data structure
- optimal cost