1 code implementation • 16 Nov 2022 • Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
We show that the proposed features contain important information related to the empirical hardness of a problem instance that was missing in earlier features from the literature by training machine learning models that can accurately predict the empirical hardness of a wide variety of 0-1 knapsack problem instances.
no code implementations • 16 Dec 2021 • Tu-San Pham, Antoine Legrain, Patrick De Causmaecker, Louis-Martin Rousseau
When our prediction-based approach is compared to flat-reservation policies, it does a better job of preventing overdue treatments for emergency patients, while also maintaining comparable waiting times for the other patients.
no code implementations • 24 Oct 2020 • Ziyi Chen, Patrick De Causmaecker, Yajie Dou
The personnel rostering problem is the problem of finding an optimal way to assign employees to shifts, subject to a set of hard constraints which all valid solutions must follow, and a set of soft constraints which define the relative quality of valid solutions.
2 code implementations • 22 Oct 2020 • Jorik Jooken, Pieter Leyman, Tony Wauters, Patrick De Causmaecker
The algorithm is based on Monte Carlo tree search, a popular algorithm in game playing that is used to explore game trees and represents the state-of-the-art algorithm for a number of games.
1 code implementation • 5 Oct 2020 • Thibault Lechien, Jorik Jooken, Patrick De Causmaecker
Predicting and comparing algorithm performance on graph instances is challenging for multiple reasons.
no code implementations • 13 Jun 2018 • Matthieu De Laere, San Tu Pham, Patrick De Causmaecker
The Steiner Tree Problem (STP) in graphs is an important problem with various applications in many areas such as design of integrated circuits, evolution theory, networking, etc.
no code implementations • 2 Sep 2016 • San Pham, Jo Devriendt, Maurice Bruynooghe, Patrick De Causmaecker
The IDP knowledge base system currently uses MiniSAT(ID) as its backend Constraint Programming (CP) solver.
no code implementations • 12 Mar 2016 • Nguyen Thi Thanh Dang, Patrick De Causmaecker
In this work, we propose a systematic method to characterize each neighborhood's behaviours, representing them as a feature vector, and using cluster analysis to form similar groups of neighborhoods.
no code implementations • 17 Jan 2015 • Sara Ceschia, Nguyen Thi Thanh Dang, Patrick De Causmaecker, Stefaan Haspeslagh, Andrea Schaerf
In this paper, we provide all information to participate to the Second International Nurse Rostering Competition (INRC-II).