Polynomial formulation and heuristic based approach for the k-travelling repairman problem.
Imen Ome EzzineSonda ElloumiPublished in: Int. J. Math. Oper. Res. (2012)
Keyphrases
- heuristic solution
- lagrangean relaxation
- traveling salesman
- dynamic programming
- mixed integer program
- branch and bound procedure
- exact algorithms
- lp relaxation
- linear programming relaxation
- depth first search
- data sets
- approximation algorithms
- constraint satisfaction
- tabu search
- linear programming
- optimization problems
- state space
- search algorithm