Patrick De Causmaecker

Patrick De Causmaecker

Katholieke Universiteit Leuven

H-index: 44

Europe-Belgium

About Patrick De Causmaecker

Patrick De Causmaecker, With an exceptional h-index of 44 and a recent h-index of 26 (since 2020), a distinguished researcher at Katholieke Universiteit Leuven, specializes in the field of Optimisation, Heuristics, Artificial Intelligence, Timetabling, Physics.

His recent articles reflect a diverse array of research interests and contributions to the field:

What makes a 0–1 knapsack problem instance hard?

A computation of D (9) using FPGA Supercomputing

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

A combined mixed integer programming and deep neural network-assisted heuristics algorithm for the nurse rostering problem

Data-driven Passenger-seeking Recommendation System for Street-hailing Taxis

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

A prediction-based approach for online dynamic appointment scheduling: A case study in radiotherapy treatment

Evolving test instances of the Hamiltonian completion problem

Patrick De Causmaecker Information

University

Position

gewoon hoogleraar computerwetenschappen

Citations(all)

8701

Citations(since 2020)

2318

Cited By

7361

hIndex(all)

44

hIndex(since 2020)

26

i10Index(all)

96

i10Index(since 2020)

55

Email

University Profile Page

Katholieke Universiteit Leuven

Google Scholar

View Google Scholar Profile

Patrick De Causmaecker Skills & Research Interests

Optimisation

Heuristics

Artificial Intelligence

Timetabling

Physics

Top articles of Patrick De Causmaecker

Title

Journal

Author(s)

Publication Date

What makes a 0–1 knapsack problem instance hard?

Jorik Jooken

Patrick De Causmaecker

2023/5/25

A computation of D (9) using FPGA Supercomputing

arXiv preprint arXiv:2304.03039

Lennart Van Hirtum

Patrick De Causmaecker

Jens Goemaere

Tobias Kenter

Heinrich Riebler

...

2023/4/6

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

European Journal of Operational Research

Jorik Jooken

Pieter Leyman

Patrick De Causmaecker

2023/11/16

A combined mixed integer programming and deep neural network-assisted heuristics algorithm for the nurse rostering problem

Applied Soft Computing

Ziyi Chen

Patrick De Causmaecker

Yajie Dou

2023/3/1

Data-driven Passenger-seeking Recommendation System for Street-hailing Taxis

Duy Hoang Tran

Patrick De Causmaecker

Laetitia Jourdan

2023/7/3

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

Computers & Operations Research

Jorik Jooken

Pieter Leyman

Tony Wauters

Patrick De Causmaecker

2023/2/1

A prediction-based approach for online dynamic appointment scheduling: A case study in radiotherapy treatment

INFORMS Journal on Computing

Tu San Pham

Antoine Legrain

Patrick De Causmaecker

Louis-Martin Rousseau

2023/4/19

Evolving test instances of the Hamiltonian completion problem

Computers & Operations Research

Thibault Lechien

Jorik Jooken

Patrick De Causmaecker

2023/1/1

Monte Carlo Tree Search and Instance Space Analysis for the 0-1 Knapsack Problem

Jorik Jooken

Patrick De Causmaecker

Pieter Leyman

Jan Goedgebeur

Tony Wauters

2023/6/12

A new class of hard problem instances for the 0–1 knapsack problem

European Journal of Operational Research

Jorik Jooken

Pieter Leyman

Patrick De Causmaecker

2022/9/16

Neural networked-assisted method for the nurse rostering problem

Computers & Industrial Engineering

Ziyi Chen

Yajie Dou

Patrick De Causmaecker

2022/9/1

Adaptive passenger-finding recommendation system for taxi drivers with load balancing problem

Computers & Industrial Engineering

Duy Hoang Tran

Pieter Leyman

Patrick De Causmaecker

2022/7/1

Advances in the practice and theory of automated timetabling

Journal of Scheduling

Ender Özcan

Patrick De Causmaecker

Greet Vanden Berghe

2022/6

A two-phase approach for the Radiotherapy Scheduling Problem

Health Care Management Science

Tu-San Pham

Louis-Martin Rousseau

Patrick De Causmaecker

2022/6/1

Deep neural networked assisted tree search for the personnel rostering problem

Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling-PATAT

Ziyi Chen

Patrick De Causmaecker

Yajie Dou

2021

A prediction-based approach for online dynamic patient scheduling: a case study in radiotherapy treatment

arXiv preprint arXiv:2112.08549

Tu-San Pham

Antoine Legrain

Patrick De Causmaecker

Louis-Martin Rousseau

2021/12/16

Eigenspectra of solar active region long-period oscillations

Astronomy & Astrophysics

Gulsun Dumbadze

BM Shergelashvili

Stefaan Poedts

TV Zaqarashvili

M Khodachenko

...

2021/9/1

Local search for constrained graph clustering in biological networks

Computers & Operations Research

Duy Hoang Tran

Behrouz Babaki

Dries Van Daele

Pieter Leyman

Patrick De Causmaecker

2021/8/1

Solving Vehicle Routing Problems

Jan Christiaens

2021/5/19

A metaheuristic approach for an intermittent traveling salesperson problem extension

Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling

Pieter Leyman

Patrick De Causmaecker

2021/2/1

See List of Professors in Patrick De Causmaecker University(Katholieke Universiteit Leuven)

Co-Authors

H-index: 119
De Moor Bart

De Moor Bart

Katholieke Universiteit Leuven

H-index: 96
Edmund Kieran Burke

Edmund Kieran Burke

University of Leicester

H-index: 69
Yves Moreau

Yves Moreau

Katholieke Universiteit Leuven

H-index: 49
Andrea Schaerf

Andrea Schaerf

Università degli Studi di Udine

H-index: 49
Greet Vanden Berghe

Greet Vanden Berghe

Katholieke Universiteit Leuven

H-index: 39
Teimuraz Zaqarashvili

Teimuraz Zaqarashvili

Ilia State University

academic-engine