C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Jorik Jooken
ORCID
Publication Activity (10 Years)
Years Active: 2019-2023
Publications (10 Years): 12
Top Topics
Tree Decompositions
Knapsack Problem
Top Venues
CoRR
Comput. Oper. Res.
Eur. J. Oper. Res.
COCOA (2)
</>
Publications
</>
Jorik Jooken
,
Pieter Leyman
,
Patrick De Causmaecker
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions.
Eur. J. Oper. Res.
311 (1) (2023)
Jorik Jooken
,
Pieter Leyman
,
Tony Wauters
,
Patrick De Causmaecker
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems.
Comput. Oper. Res.
150 (2023)
Thibault Lechien
,
Jorik Jooken
,
Patrick De Causmaecker
Evolving test instances of the Hamiltonian completion problem.
Comput. Oper. Res.
149 (2023)
Wen Xia
,
Jorik Jooken
,
Jan Goedgebeur
,
Shenwei Huang
-Free Graphs.
COCOA (2)
(2023)
Jorik Jooken
,
Pieter Leyman
,
Patrick De Causmaecker
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions.
CoRR
(2022)
Jorik Jooken
,
Pieter Leyman
,
Patrick De Causmaecker
A new class of hard problem instances for the 0-1 knapsack problem.
Eur. J. Oper. Res.
301 (3) (2022)
Louis Carpentier
,
Jorik Jooken
,
Jan Goedgebeur
A heuristic algorithm for the maximum happy vertices problem using tree decompositions.
CoRR
(2022)
Jan Goedgebeur
,
Jorik Jooken
,
On-Hei Solomon Lo
,
Ben Seamone
,
Carol T. Zamfirescu
Few hamiltonian cycles in graphs with one or two vertex degrees.
CoRR
(2022)
Jorik Jooken
,
Pieter Leyman
,
Patrick De Causmaecker
,
Tony Wauters
Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem.
CoRR
(2020)
Jorik Jooken
,
Pieter Leyman
,
Patrick De Causmaecker
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs.
J. Heuristics
26 (5) (2020)
Thibault Lechien
,
Jorik Jooken
,
Patrick De Causmaecker
Evolving test instances of the Hamiltonian completion problem.
CoRR
(2020)
Jorik Jooken
,
Pieter Leyman
,
Patrick De Causmaecker
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs.
CoRR
(2019)