Lower bounds and heuristics for the Windy Rural Postman Problem.
Enrique BenaventAlessandro CarrottaAngel CorberánJosé M. SanchisDaniele VigoPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- lower bound
- routing problem
- set of randomly generated instances
- running times
- upper bound
- branch and bound
- objective function
- traveling salesman problem
- finding optimal solutions
- worst case analysis
- vc dimension
- np hard
- branch and bound algorithm
- worst case
- lower and upper bounds
- families of valid inequalities
- lagrangian relaxation
- upper and lower bounds
- heuristic methods
- search algorithm
- optimal solution
- routing algorithm
- search strategies
- heuristic search
- linear programming relaxation
- shortest path
- random instances
- travel time
- online algorithms
- quadratic assignment problem
- sample size
- learning algorithm