A Benders approach for computing lower bounds for the mirrored traveling tournament problem.

Kevin K. H. Cheung

Published in: Discret. Optim. (2009)

Keyphrases

lower bound
upper bound
objective function
decomposition method
optimal solution
np hard
decomposition algorithm
worst case
branch and bound algorithm
sample complexity
upper and lower bounds
data structure
dynamic programming
optimal cost