A combined local search and integer programming approach to the traveling tournament problem.
Marc GoerigkStephan WestphalPublished in: Ann. Oper. Res. (2016)
Keyphrases
- integer programming
- np hard
- linear programming
- network flow
- lagrangian relaxation
- constraint programming
- facility location
- set covering
- integer program
- search algorithm
- ai planning
- production planning
- cutting plane
- genetic algorithm
- transportation problem
- column generation
- combinatorial optimization
- simulated annealing
- memetic algorithm
- cutting plane algorithm
- tabu search
- valid inequalities
- optimal solution
- inference problems
- set covering problem
- set partitioning
- crew scheduling
- dantzig wolfe decomposition
- vehicle routing problem with time windows
- linear programming relaxation
- linear program
- ant colony optimization
- np complete
- round robin tournament
- search space
- learning algorithm