Facets and valid inequalities for the time-dependent travelling salesman problem.
Juan José Miranda BrontIsabel Méndez-DíazPaula ZabalaPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- valid inequalities
- facet defining inequalities
- lp relaxation
- facet defining
- integer programming
- linear programming
- traveling salesman problem
- feasible solution
- mixed integer programming
- mixed integer
- lower and upper bounds
- column generation
- cutting plane algorithm
- cutting plane
- convex hull
- mixed integer linear programs
- network design problem
- integer program
- linear programming relaxation
- integer programming formulation
- integer programming problems
- vehicle routing problem with time windows
- tabu search
- lagrangian relaxation
- travel time
- optimization problems
- optimal solution
- search algorithm
- primal dual
- branch and bound
- simulated annealing
- metaheuristic
- genetic algorithm
- continuous variables