Improved bounds for the traveling umpire problem: A stronger formulation and a relax-and-fix heuristic.
Lucas de OliveiraCid C. de SouzaTallys H. YunesPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- heuristic solution
- lower bound
- lower and upper bounds
- upper bound
- lagrangean relaxation
- branch and bound search
- optimal solution
- learning algorithm
- upper and lower bounds
- search algorithm
- improved algorithm
- alternative formulations
- mixed integer linear
- optimal cost
- road network
- error bounds
- combinatorial optimization
- tabu search
- dynamic programming