Login / Signup
Lower bounds for large traveling umpire instances: New valid inequalities and a branch-and-cut algorithm.
Lucas de Oliveira
Cid C. de Souza
Tallys H. Yunes
Published in:
Comput. Oper. Res. (2016)
Keyphrases
</>
lower and upper bounds
lower bound
linear programming relaxation
objective function
randomly generated
learning algorithm
valid inequalities
dynamic programming
computational complexity
linear programming
search space
genetic algorithm
cost function
np hard
data points
computationally expensive
integer program
search algorithm
mixed integer linear programs