International Symposium on Combinatorial Optimization edition:2 location:Athens, Greece date:17-21 April 2012
The present work considers a matheuristic approach to the
optimization version of the Eternity II puzzle problem and unsigned edge matching puzzles in general. Two MILP-based constructive methods are presented for this hard combinatorial optimization problem, i.e. a greedy
and a backtracking heuristic. In addition, a local search with very large scale neighbourhoods have been implemented to further improve the results. Experimental results confirm that the presented matheuristic approach performs competitively with the state-of-the-art.