120 citations · 141 across the 7 of their papers we have counts for
7 papers
An open-source heuristic to reboot 2D nesting research
Jeroen Gardeyn, Greet Vanden Berghe, Tony Wauters
2D nesting problems rank among the most challenging cutting and packing problems. Yet, despite their practical relevance, research over the past decade has seen remarkably little p…
Decoupling Geometry from Optimization in 2D Irregular Cutting and Packing Problems: an Open-Source Collision Detection Engine
Jeroen Gardeyn, Greet Vanden Berghe, Tony Wauters
Addressing irregular cutting and packing (C&P) optimization problems poses two distinct challenges: the geometric challenge of determining whether or not an item can be placed feas…
Robust personnel rostering: how accurate should absenteeism predictions be?
Martina Doneda, Pieter Smet, Giuliana Carello +2
Disruptions to personnel rosters caused by absenteeism often necessitate last-minute adjustments to the employees' working hours. A common strategy to mitigate the impact of such c…
Operational Research: Methods and Applications
Fotios Petropoulos, Gilbert Laporte, Emel Aktas +79
Throughout its history, Operational Research has evolved to include a variety of methods, models and algorithms that have been applied to a diverse and wide range of contexts. This…
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…
Optimal Decision Trees for the Algorithm Selection Problem: Integer Programming Based Approaches
Matheus Guedes Vilas Boas, Haroldo Gambini Santos, Luiz Henrique de Campos Merschmann +1
Even though it is well known that for most relevant computational problems different algorithms may perform better on different classes of problem instances, most researchers still…
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…