Patrick De Causmaecker

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:

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

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

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

What makes a 0–1 knapsack problem instance hard?

A computation of D (9) using FPGA Supercomputing

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

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

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

Google Scholar

Patrick De Causmaecker Skills & Research Interests

Optimisation

Heuristics

Artificial Intelligence

Timetabling

Physics

Top articles of Patrick De Causmaecker

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

2023/7/3

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

Laetitia Jourdan
Laetitia Jourdan

H-Index: 19

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

INFORMS Journal on Computing

2023/4/19

Antoine Legrain
Antoine Legrain

H-Index: 7

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

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

2023/6/12

What makes a 0–1 knapsack problem instance hard?

2023/5/25

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

A computation of D (9) using FPGA Supercomputing

arXiv preprint arXiv:2304.03039

2023/4/6

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

Applied Soft Computing

2023/3/1

Ziyi Chen
Ziyi Chen

H-Index: 2

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

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

Computers & Operations Research

2023/2/1

Pieter Leyman
Pieter Leyman

H-Index: 5

Tony Wauters
Tony Wauters

H-Index: 11

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

Evolving test instances of the Hamiltonian completion problem

Computers & Operations Research

2023/1/1

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

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

European Journal of Operational Research

2023/11/16

Pieter Leyman
Pieter Leyman

H-Index: 5

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

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

European Journal of Operational Research

2022/9/16

Pieter Leyman
Pieter Leyman

H-Index: 5

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

Neural networked-assisted method for the nurse rostering problem

Computers & Industrial Engineering

2022/9/1

Ziyi Chen
Ziyi Chen

H-Index: 2

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

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

Computers & Industrial Engineering

2022/7/1

Pieter Leyman
Pieter Leyman

H-Index: 5

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

Advances in the practice and theory of automated timetabling

Journal of Scheduling

2022/6

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

Greet Vanden Berghe
Greet Vanden Berghe

H-Index: 31

A two-phase approach for the Radiotherapy Scheduling Problem

Health Care Management Science

2022/6/1

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

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

arXiv preprint arXiv:2112.08549

2021/12/16

Antoine Legrain
Antoine Legrain

H-Index: 7

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

Eigenspectra of solar active region long-period oscillations

Astronomy & Astrophysics

2021/9/1

Local search for constrained graph clustering in biological networks

Computers & Operations Research

2021/8/1

Pieter Leyman
Pieter Leyman

H-Index: 5

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

Solving Vehicle Routing Problems

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

2021/2/1

Pieter Leyman
Pieter Leyman

H-Index: 5

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

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

2021

Ziyi Chen
Ziyi Chen

H-Index: 2

Patrick De Causmaecker
Patrick De Causmaecker

H-Index: 25

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

Co-Authors

academic-engine