Heuristic and lower bound for a stochastic location-routing problem.
Maria Albareda-SambolaElena FernándezGilbert LaportePublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- special case
- lower bound
- np hard
- optimal solution
- set of randomly generated instances
- optimal cost
- upper bound
- lower and upper bounds
- heuristic solution
- sufficiently accurate
- lagrangian relaxation
- lower bounding
- depth first search
- branch and bound method
- linear programming relaxation
- branch and bound
- branch and bound algorithm
- greedy heuristic
- running times
- worst case
- vehicle routing problem
- vehicle routing
- strongly np hard
- objective function
- tree search
- monte carlo
- online algorithms
- heuristic methods
- randomized algorithm
- routing problem
- knapsack problem
- dynamic programming
- search algorithm