1 citations · 1 across the 3 of their papers we have counts for
3 papers
A solution to a Partitioned Balanced Tournament Design of side 11
Federico Della Croce, Gabriele Dragotto, Fabio Salassa
We provide a solution to the Partitioned Balanced Tournament Design of side . The solution has been generated by exploiting combinatorial optimization methods.
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…
No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths
Jean-Charles Billaut, Federico Della Croce, Fabio Salassa +1
In shop scheduling, several applications exist where it is required that some components perform consecutively. We refer to no-idle schedules if machines are required to operate wi…