Patrick De Causmaecker

Orcid: 0000-0002-6763-1945

Affiliations:
  • Catholic University of Leuven, Belgium


According to our database1, Patrick De Causmaecker authored at least 97 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions.
Eur. J. Oper. Res., November, 2023

A combined mixed integer programming and deep neural network-assisted heuristics algorithm for the nurse rostering problem.
Appl. Soft Comput., March, 2023

A computation of D(9) using FPGA Supercomputing.
CoRR, 2023

Evolving test instances of the Hamiltonian completion problem.
Comput. Oper. Res., 2023

Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems.
Comput. Oper. Res., 2023

2022
Advances in the practice and theory of automated timetabling.
J. Sched., 2022

A new class of hard problem instances for the 0-1 knapsack problem.
Eur. J. Oper. Res., 2022

Adaptive passenger-finding recommendation system for taxi drivers with load balancing problem.
Comput. Ind. Eng., 2022

Neural networked-assisted method for the nurse rostering problem.
Comput. Ind. Eng., 2022

2021
A prediction-based approach for online dynamic radiotherapy scheduling.
CoRR, 2021

Local search for constrained graph clustering in biological networks.
Comput. Oper. Res., 2021

Preface.
Ann. Math. Artif. Intell., 2021

2020
The intermittent travelling salesman problem.
Int. Trans. Oper. Res., 2020

A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs.
J. Heuristics, 2020

Minimizing makespan on a single machine with release dates and inventory constraints.
Eur. J. Oper. Res., 2020

Neural Networked Assisted Tree Search for the Personnel Rostering Problem.
CoRR, 2020

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

2019
A combined approach for analysing heuristic algorithms.
J. Heuristics, 2019

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.
Comput. Oper. Res., 2019

The Second International Nurse Rostering Competition.
Ann. Oper. Res., 2019

Declarative Local Search for Predicate Logic.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2019

Automating Personnel Rostering by Learning Constraints Using Tensors.
Proceedings of the 31st IEEE International Conference on Tools with Artificial Intelligence, 2019

2018
Applying Algorithm Selection - a Case Study for the Generalised Assignment Problem.
Electron. Notes Discret. Math., 2018

Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent.
CoRR, 2018

A Regression-Based Methodology for Online Algorithm Selection.
Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Analysis of Algorithm Components and Parameters: Some Case Studies.
Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

Adaptive Multi-objective Local Search Algorithms for the Permutation Flowshop Scheduling Problem.
Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

Data-driven Onboard Scheduling for an Autonomous Observation Satellite.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
The Intermittent Traveling Salesman Problem with Different Temperature Profiles: Greedy or not?
CoRR, 2017

Optimization in large graphs: Toward a better future?
CoRR, 2017

Configuring irace using surrogate configuration benchmarks.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016
Good Laboratory Practice for optimization research.
J. Oper. Res. Soc., 2016

Polynomially solvable personnel rostering problems.
Eur. J. Oper. Res., 2016

A MIP Backend for the IDP System.
CoRR, 2016

A study of decision support models for online patient-to-room assignment planning.
Ann. Oper. Res., 2016

Characterization of Neighborhood Behaviours in a Multi-neighborhood Local Search Algorithm.
Proceedings of the Learning and Intelligent Optimization - 10th International Conference, 2016

Reinforcement Learning for Automatic Online Algorithm Selection - an Empirical Study.
Proceedings of the 16th ITAT Conference Information Technologies, 2016

2015
A learning-based optimization approach to multi-project scheduling.
J. Sched., 2015

Second International Nurse Rostering Competition (INRC-II) - Problem Description and Rules -.
CoRR, 2015

A Combinatorial Benders' decomposition for the lock scheduling problem.
Comput. Oper. Res., 2015

Learning a Hidden Markov Model-Based Hyper-heuristic.
Proceedings of the Learning and Intelligent Optimization - 9th International Conference, 2015

Towards a Knowledge Base for Performance Data: A Formal Model for Performance Comparison.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Solving Euclidean Steiner Tree Problems with Multi Swarm Optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

2014
Exact and heuristic methods for placing ships in locks.
Eur. J. Oper. Res., 2014

An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem.
Eur. J. Oper. Res., 2014

Modelling and evaluation issues in nurse rostering.
Ann. Oper. Res., 2014

The first international nurse rostering competition 2010.
Ann. Oper. Res., 2014

Motivations for the Development of a Multi-objective Algorithm Configurator.
Proceedings of the ICORES 2014, 2014

Fast approximation of reach hierarchies in networks.
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014

2013
Boosting Metaheuristic Search Using Reinforcement Learning.
Proceedings of the Hybrid Metaheuristics, 2013

Nurse Rostering: A Complex Example of Personnel Scheduling with Perspectives.
Proceedings of the Automated Scheduling and Planning - From Theory to Practice, 2013

A new hyper-heuristic as a general problem solver: an implementation in HyFlex.
J. Sched., 2013

An improved best-fit heuristic for the orthogonal strip packing problem.
Int. Trans. Oper. Res., 2013

An investigation on the generality level of selection hyper-heuristics under different empirical conditions.
Appl. Soft Comput., 2013

Tour Suggestion for Outdoor Activities.
Proceedings of the Web and Wireless Geographical Information Systems, 2013

An Efficient Translation Scheme for Representing Nurse Rostering Problems as Satisfiability Problems.
Proceedings of the ICAART 2013, 2013

Decomposition of Intervals in the Space of Anti-Monotonic Functions.
Proceedings of the Tenth International Conference on Concept Lattices and Their Applications, 2013

2012
A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice.
J. Sched., 2012

Mashups by orchestration and widget-based personal environments: Key challenges, solution strategies, and an application.
Program, 2012

Ubiquitous web navigation through harvesting embedded semantic data: A mobile scenario.
Integr. Comput. Aided Eng., 2012

Outlier detection in relational data: A case study in geographical information systems.
Expert Syst. Appl., 2012

Real-world production scheduling for the food industry: An integrated approach.
Eng. Appl. Artif. Intell., 2012

An unbiased evaluation of gene prioritization tools.
Bioinform., 2012

Towards a reference model for timetabling and rostering.
Ann. Oper. Res., 2012

Local search neighbourhoods for dealing with a novel nurse rostering model.
Ann. Oper. Res., 2012

The Effect of the Set of Low-Level Heuristics on the Performance of Selection Hyper-heuristics.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

Fast Permutation Learning.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

An Intelligent Hyper-Heuristic Framework for CHeSC 2011.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

2011
A categorisation of nurse rostering problems.
J. Sched., 2011

Learning agents for the multi-mode project scheduling problem.
J. Oper. Res. Soc., 2011

Formal modelling, knowledge representation and reasoning for design and development of user-centric pervasive software: a meta-review.
Int. J. Metadata Semant. Ontologies, 2011

A guide to web tools to prioritize candidate genes.
Briefings Bioinform., 2011

Mashups and widget orchestration.
Proceedings of the MEDES '11: International ACM Conference on Management of Emergent Digital EcoSystems, 2011

Visualization of networked collaboration in digital ecosystems through two-mode network patterns.
Proceedings of the MEDES '11: International ACM Conference on Management of Emergent Digital EcoSystems, 2011

2010
Ubiquitous Web for Ubiquitous Environments: The Role of Embedded Semantics.
J. Mobile Multimedia, 2010

A multi-objective approach for robust airline scheduling.
Comput. Oper. Res., 2010

A hybrid tabu search algorithm for automatically assigning patients to beds.
Artif. Intell. Medicine, 2010

Semantic Mash-Up Personal and Pervasive Learning Environments (SMupple).
Proceedings of the HCI in Work and Learning, Life and Leisure, 2010

Utilizing Embedded Semantics for User-Driven Design of Pervasive Environments.
Proceedings of the Metadata and Semantic Research - 4th International Conference, 2010

Multi-facade and Ubiquitous Web Navigation and Access through Embedded Semantics.
Proceedings of the Future Generation Information Technology, 2010

Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

A game theoretic approach to decentralized multi-project scheduling.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

2009
Context and Adaptivity in Pervasive Computing Environments: Links with Software Engineering and Ontological Engineering.
J. Softw., 2009

A decomposed metaheuristic approach for a real-world university timetabling problem.
Eur. J. Oper. Res., 2009

Merging model driven and ontology driven system development approaches pervasive computing perspective.
Proceedings of the 24th International Symposium on Computer and Information Sciences, 2009

2008
Dynamic scheduling of multi-media streams in home automation systems.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

2006
Designing trust with software agents: A case study.
J. Inf. Commun. Ethics Soc., 2006

Metaheuristics for Handling Time Interval Coverage Constraints in Nurse Scheduling.
Appl. Artif. Intell., 2006

2004
Novel Metaheuristic Approaches to Nurse Rostering Problems in Belgian Hospitals.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

The State of the Art of Nurse Rostering.
J. Sched., 2004

Semantic Components for Timetabling.
Proceedings of the Practice and Theory of Automated Timetabling V, 2004

2002
Relaxation of Coverage Constraints in Hospital Personnel Rostering.
Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

A multi criteria meta-heuristic approach to nurse rostering.
Proceedings of the 2002 Congress on Evolutionary Computation, 2002

2001
A Memetic Approach to the Nurse Rostering Problem.
Appl. Intell., 2001

Fitness evaluation for nurse scheduling problems.
Proceedings of the 2001 Congress on Evolutionary Computation, 2001

Sympathetic agents assist route in route planning.
Proceedings of the Fifth International Conference on Autonomous Agents, 2001

1998
A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem.
Proceedings of the Simulated Evolution and Learning, 1998


  Loading...