Using a greedy random adaptative search procedure to solve the cover printing problem.

Daniel Tuyttens Arnaud Vandaele

Published in: Comput. Oper. Res. (2010)

Keyphrases

search procedure
search algorithm
hill climbing
search space
tabu search
simulated annealing
path relinking
feature selection
high speed
greedy algorithm
search procedures
low cost
search strategy
mathematical programming