| Publication | Date of Publication | Type |
|---|
Solving systems of equations on antichains for the computation of the ninth Dedekind number
Journal of Combinatorial Optimization | 2026-01-23 | Paper |
A Prediction-Based Approach for Online Dynamic Appointment Scheduling: A Case Study in Radiotherapy Treatment
INFORMS Journal on Computing | 2024-03-22 | Paper |
| A computation of the Ninth Dedekind Number using FPGA Supercomputing | 2024-01-29 | Dataset |
The intermittent travelling salesman problem
International Transactions in Operational Research | 2023-11-16 | Paper |
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
European Journal of Operational Research | 2023-07-11 | Paper |
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
European Journal of Operational Research | 2023-07-11 | Paper |
| A computation of D(9) using FPGA Supercomputing | 2023-04-06 | Paper |
Evolving test instances of the Hamiltonian completion problem
Computers & Operations Research | 2022-12-19 | Paper |
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
Computers & Operations Research | 2022-12-19 | Paper |
A new class of hard problem instances for the 0-1 knapsack problem
European Journal of Operational Research | 2022-05-20 | Paper |
Local search for constrained graph clustering in biological networks
Computers & Operations Research | 2022-03-07 | Paper |
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
(available as arXiv preprint) | 2020-10-22 | Paper |
| Declarative local search for predicate logic | 2019-10-10 | Paper |
The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models
Computers & Operations Research | 2018-12-17 | Paper |
A combinatorial Benders' decomposition for the lock scheduling problem
Computers & Operations Research | 2016-11-10 | Paper |
Polynomially solvable personnel rostering problems
European Journal of Operational Research | 2016-10-07 | Paper |
An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem
European Journal of Operational Research | 2016-06-24 | Paper |
A study of decision support models for online patient-to-room assignment planning
Annals of Operations Research | 2016-05-18 | Paper |
| Intervals of Antichains and Their Decompositions | 2016-02-15 | Paper |
A learning-based optimization approach to multi-project scheduling
Journal of Scheduling | 2015-03-26 | Paper |
Exact and heuristic methods for placing ships in locks
European Journal of Operational Research | 2015-02-19 | Paper |
The first international nurse rostering competition 2010
Annals of Operations Research | 2014-11-26 | Paper |
Modelling and evaluation issues in nurse rostering
Annals of Operations Research | 2014-11-26 | Paper |
| On the number of antichains of sets in a finite universe | 2014-07-16 | Paper |
An improved best-fit heuristic for the orthogonal strip packing problem
International Transactions in Operational Research | 2013-11-14 | Paper |
Local search neighbourhoods for dealing with a novel nurse rostering model
Annals of Operations Research | 2012-11-15 | Paper |
Towards a reference model for timetabling and rostering
Annals of Operations Research | 2012-11-15 | Paper |
| Partitioning in the space of antimonotonic functions | 2011-03-15 | Paper |
A multi-objective approach for robust airline scheduling
Computers & Operations Research | 2009-12-22 | Paper |
A decomposed metaheuristic approach for a real-world university timetabling problem
European Journal of Operational Research | 2009-01-08 | Paper |
The state of the art of nurse rostering
Journal of Scheduling | 2007-12-20 | Paper |
A memetic approach to the nurse rostering problem
Applied Intelligence | 2002-09-20 | Paper |
