A heuristic for the Minimum Score Separation Problem, a combinatorial problem associated with the cutting stock problem.
Kai Helge BeckerGautam AppaPublished in: J. Oper. Res. Soc. (2015)
Keyphrases
- integer programming
- search algorithm
- round robin tournament
- dynamic programming
- linear programming relaxation
- optimal solution
- small sized
- heuristic solution
- timetabling problem
- exact algorithms
- constraint satisfaction
- tabu search
- simulated annealing
- minimum cost
- column generation
- mixed integer programming
- solution quality
- knapsack problem
- constant factor
- genetic algorithm