< Back to previous page
Researcher
Jorik Jooken
- Disciplines:Computer science, Operations research and mathematical programming, Machine learning and decision making, Analysis of algorithms and complexity, Applied discrete mathematics
Affiliations
- Computer Science, Kulak Kortrijk Campus (Department)
Member
From1 Sep 2019 → Today
Projects
1 - 3 of 3
- Building bridges between computer-assisted graph theory and operations researchFrom1 Oct 2023 → TodayFunding: FWO junior postdoctoral fellowship
- New algorithms and computer-aided methods for solving hamiltonicity problemsFrom5 Jul 2023 → TodayFunding: Own budget, for example: patrimony, inscription fees, gifts
- 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
Publications
1 - 8 of 8
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions(2023)
Authors: Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
Pages: 36 - 55 - 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
- 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 - A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs(2020)
Authors: Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
- Evolving test instances of the Hamiltonian completion problem.(2020)
Authors: Jorik Jooken
- Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem.(2020)
Authors: Jorik Jooken, Pieter Leyman, Tony Wauters