Title: The Eternity II puzzle: a matheuristic approach
Authors: Salassa, Fabio ×
Wauters, Tony
Vancroonenburg, Wim
Della Croce, Federico
Vanden Berghe, Greet #
Issue Date: 17-Apr-2012
Conference: International Symposium on Combinatorial Optimization edition:2 location:Athens, Greece date:17-21 April 2012
Abstract: 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.
Publication status: accepted
KU Leuven publication type: IMa
Appears in Collections:Technologiecluster Computerwetenschappen
Computer Science Technology TC, Technology Campuses Ghent and Aalst
Computer Science, Campus Kulak Kortrijk
Informatics Section
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.


All items in Lirias are protected by copyright, with all rights reserved.