Jorik Jooken

According to our database, Jorik Jooken authored at least 10 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

A heuristic algorithm using tree decompositions for the maximum happy vertices problem.

Louis Carpentier, Jorik Jooken, Jan Goedgebeur

J. Heuristics, April, 2024

2023

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

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker

Eur. J. Oper. Res., November, 2023

Evolving test instances of the Hamiltonian completion problem.

Thibault Lechien, Jorik Jooken, Patrick De Causmaecker

Comput. Oper. Res., 2023

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

Jorik Jooken, Pieter Leyman, Tony Wauters, Patrick De Causmaecker

Comput. Oper. Res., 2023

Critical (P_5,dart)-Free Graphs.

Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

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

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker

Eur. J. Oper. Res., 2022

Few hamiltonian cycles in graphs with one or two vertex degrees.

Jan Goedgebeur, Jorik Jooken, On-Hei Solomon Lo, Ben Seamone, Carol T. Zamfirescu

CoRR, 2022

A heuristic algorithm for the maximum happy vertices problem using tree decompositions.

Louis Carpentier, Jorik Jooken, Jan Goedgebeur

CoRR, 2022

2020

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

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker

J. Heuristics, 2020

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

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker, Tony Wauters

CoRR, 2020