1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
Models and algorithms for simple disjunctive temporal problems
Carlo S. Sartori, Pieter Smet, Greet Vanden Berghe
Simple temporal problems represent a powerful class of models capable of describing the temporal relations between events that arise in many real-world applications such as logisti…
cs.DS2017★ 1 cited
MILP and Max-Clique based heuristics for the Eternity II puzzle
Fabio Salassa, Wim Vancroonenburg, Tony Wauters +2
The present paper considers a hybrid local search approach to the Eternity II puzzle and to unsigned, rectangular, edge matching puzzles in general. Both an original mixed-integer…