Search Results for author:
Found 9 papers, 3 papers with code
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
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.
A prediction-based approach for online dynamic patient scheduling: a case study in radiotherapy treatment
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.
Neural Networked Assisted Tree Search for the Personnel Rostering Problem
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.
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
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.
Evolving test instances of the Hamiltonian completion problem
Predicting and comparing algorithm performance on graph instances is challenging for multiple reasons.
Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent
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.
A MIP Backend for the IDP System
The IDP knowledge base system currently uses MiniSAT(ID) as its backend Constraint Programming (CP) solver.
Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm
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.
Second International Nurse Rostering Competition (INRC-II) --- Problem Description and Rules ---
In this paper, we provide all information to participate to the Second International Nurse Rostering Competition (INRC-II).
