This dataset is generated for the paper titled "An exact branch-and-price approach for the medical student scheduling problem", published in the Computers and Operations Research (DOI: TO DO - when published). The dataset is organized per experiment performed in the paper. The instances are generated according to the instructions described in the paper (see Section 5.1) and grouped per visited setting (see Table 1 in the paper). For each setting, there is a folder that includes the instances and the final obtained solutions per instance, indicated as "BPOptIns_OptSol.txt". The format of an instance file is discussed in readme_instance.txt. The format of a solution file is discussed in readme_solution.txt. For a summary of the results, we r...
Integer programming can be used to provide solutions to complex decision and planning problems occur...
In this paper, we study a surgical cases assignment problem (SCAP) of assigning a set of surgical ca...
For the matching problem with vanishing arcs, an optimal algorithm based on the branch and bound met...
This dataset is generated for the paper titled "An exact branch-and-price approach for the medical s...
“This dataset is generated for the paper titled "A decomposition-based heuristic procedure for ...
Branch-and-price is an increasingly important technique for solving large integer programming models...
Scheduling trainees (graduate students) is a complicated problem that has to be solved frequently in...
In this paper we will investigate how to sequence surgical cases in a day-care facility so that mult...
Scheduling trainees (graduate students) is a complicated problem that has to be solved frequently in...
A common problem at hospitals is the extreme variation in daily (even hourly) workload pressure for ...
Many timetabling and assignment problems at the Danish High Schools are evident candidates for apply...
This paper tackles the problem of allocating medical students to clinical specialities over a number...
In this article, we approach the Examination-Timetabling Problem (ETP) from a student-centric point ...
This work introduces a procedure to solve the multi-skill project scheduling problem (MSPSP) (Néron ...
In this paper we investigate how to sequence surgical cases in a day-care facility. We specify a mul...
Integer programming can be used to provide solutions to complex decision and planning problems occur...
In this paper, we study a surgical cases assignment problem (SCAP) of assigning a set of surgical ca...
For the matching problem with vanishing arcs, an optimal algorithm based on the branch and bound met...
This dataset is generated for the paper titled "An exact branch-and-price approach for the medical s...
“This dataset is generated for the paper titled "A decomposition-based heuristic procedure for ...
Branch-and-price is an increasingly important technique for solving large integer programming models...
Scheduling trainees (graduate students) is a complicated problem that has to be solved frequently in...
In this paper we will investigate how to sequence surgical cases in a day-care facility so that mult...
Scheduling trainees (graduate students) is a complicated problem that has to be solved frequently in...
A common problem at hospitals is the extreme variation in daily (even hourly) workload pressure for ...
Many timetabling and assignment problems at the Danish High Schools are evident candidates for apply...
This paper tackles the problem of allocating medical students to clinical specialities over a number...
In this article, we approach the Examination-Timetabling Problem (ETP) from a student-centric point ...
This work introduces a procedure to solve the multi-skill project scheduling problem (MSPSP) (Néron ...
In this paper we investigate how to sequence surgical cases in a day-care facility. We specify a mul...
Integer programming can be used to provide solutions to complex decision and planning problems occur...
In this paper, we study a surgical cases assignment problem (SCAP) of assigning a set of surgical ca...
For the matching problem with vanishing arcs, an optimal algorithm based on the branch and bound met...