< Back to previous page
Researcher
Patrick De Causmaecker
- Disciplines:Applied mathematics in specific fields, Computer architecture and networks, Distributed computing, Information sciences, Information systems, Programming languages, Scientific computing, Theoretical computer science, Visual computing, Other information and computing sciences
Affiliations
- Computer Science, Kulak Kortrijk Campus (Department)
Member
From1 Jan 2009 → Today - Faculty of Science, Kulak Kortrijk Campus (Faculty)
Member
From1 Oct 2005 → 31 Dec 2008
Projects
1 - 10 of 20
- Optimisation and Deep LearningFrom1 Jan 2020 → 30 Jul 2023Funding: BOF - doctoral mandates
- Monte Carlo Tree Search and Instance Space Analysis for the 0-1 Knapsack ProblemFrom23 Oct 2019 → 12 Jun 2023Funding: Own budget, for example: patrimony, inscription fees, gifts
- Integrating machine learning into heuristic optimization: How can we develop high-performing algorithms for real-world problems with graph-based representation?From1 Oct 2018 → 30 Sep 2021Funding: FWO fellowships
- Data-driven Passenger-seeking Recommendation System for Street-hailing TaxisFrom3 Apr 2018 → 3 Jul 2023Funding: Own budget, for example: patrimony, inscription fees, gifts
- Data-driven logistics.From1 Jan 2018 → 31 Dec 2021Funding: FWO Strategic Basic Research (SBO)
- Dynamic Combinatorial OptimizationFrom1 Oct 2017 → 30 Sep 2021Funding: IOF - Industrial Research Fund
- Learning-based optimization methodologyFrom8 Sep 2017 → 8 Sep 2021Funding: Own budget, for example: patrimony, inscription fees, gifts
- Extending Automatic Algorithm Selection to the Online SettingFrom2 Sep 2014 → 15 Sep 2018Funding: BOF - Doctoral projects
- Data Analytics for Algorithm DesignFrom4 Feb 2014 → 16 May 2018Funding: Own budget, for example: patrimony, inscription fees, gifts
- Decomposition-based algorithms for optimization problemsFrom1 Dec 2013 → 10 Nov 2017Funding: Own budget, for example: patrimony, inscription fees, gifts
Publications
1 - 10 of 137
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions(2023)
Authors: Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
Pages: 36 - 55 - Data-driven Passenger-seeking Recommendation System for Street-hailing Taxis(2023)
Authors: Duy Hoang Tran, Patrick De Causmaecker
- Monte Carlo Tree Search and Instance Space Analysis for the 0-1 Knapsack Problem(2023)
Authors: Jorik Jooken, Patrick De Causmaecker, Jan Goedgebeur, Pieter Leyman, Tony Wauters
- A combined mixed integer programming and deep neural network-assisted heuristics algorithm for the nurse rostering problem(2023)
Authors: Patrick De Causmaecker
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems(2023)
Authors: Jorik Jooken, Pieter Leyman, Tony Wauters, Patrick De Causmaecker
- Evolving test instances of the Hamiltonian completion problem(2023)
Authors: Jorik Jooken, Patrick De Causmaecker
- A new class of hard problem instances for the 0-1 knapsack problem(2022)
Authors: Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
Pages: 841 - 854 - Neural networked-assisted method for the nurse rostering problem(2022)
Authors: Patrick De Causmaecker
- Adaptive passenger-finding recommendation system for taxi drivers with load balancing problem(2022)
Authors: Duy Hoang Tran, Pieter Leyman, Patrick De Causmaecker
- A two-phase approach for the Radiotherapy Scheduling Problem(2022)
Authors: Patrick De Causmaecker
Pages: 191 - 207