Picture for Patrick De Causmaecker

Patrick De Causmaecker

Features for the 0-1 knapsack problem based on inclusionwise maximal solutions

Add code
Nov 16, 2022
Viaarxiv icon

A prediction-based approach for online dynamic radiotherapy scheduling

Add code
Dec 16, 2021
Figure 1 for A prediction-based approach for online dynamic radiotherapy scheduling
Figure 2 for A prediction-based approach for online dynamic radiotherapy scheduling
Figure 3 for A prediction-based approach for online dynamic radiotherapy scheduling
Figure 4 for A prediction-based approach for online dynamic radiotherapy scheduling
Viaarxiv icon

Neural Networked Assisted Tree Search for the Personnel Rostering Problem

Add code
Oct 24, 2020
Figure 1 for Neural Networked Assisted Tree Search for the Personnel Rostering Problem
Figure 2 for Neural Networked Assisted Tree Search for the Personnel Rostering Problem
Figure 3 for Neural Networked Assisted Tree Search for the Personnel Rostering Problem
Figure 4 for Neural Networked Assisted Tree Search for the Personnel Rostering Problem
Viaarxiv icon

Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem

Add code
Oct 22, 2020
Figure 1 for Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem
Figure 2 for Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem
Figure 3 for Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem
Figure 4 for Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem
Viaarxiv icon

Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent

Add code
Jun 13, 2018
Figure 1 for Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent
Figure 2 for Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent
Figure 3 for Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent
Figure 4 for Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent
Viaarxiv icon

A MIP Backend for the IDP System

Add code
Sep 02, 2016
Figure 1 for A MIP Backend for the IDP System
Figure 2 for A MIP Backend for the IDP System
Figure 3 for A MIP Backend for the IDP System
Viaarxiv icon

Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm

Add code
Mar 12, 2016
Figure 1 for Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm
Figure 2 for Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm
Figure 3 for Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm
Figure 4 for Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm
Viaarxiv icon

Second International Nurse Rostering Competition (INRC-II) --- Problem Description and Rules ---

Add code
Jan 17, 2015
Figure 1 for Second International Nurse Rostering Competition (INRC-II) --- Problem Description and Rules ---
Figure 2 for Second International Nurse Rostering Competition (INRC-II) --- Problem Description and Rules ---
Figure 3 for Second International Nurse Rostering Competition (INRC-II) --- Problem Description and Rules ---
Figure 4 for Second International Nurse Rostering Competition (INRC-II) --- Problem Description and Rules ---
Viaarxiv icon