Spremljaj
Jorik Jooken
Naslov
Navedeno
Navedeno
Leto
A new class of hard problem instances for the 0–1 knapsack problem
J Jooken, P Leyman, P De Causmaecker
European Journal of Operational Research 301 (3), 841-854, 2022
192022
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
J Jooken, P Leyman, T Wauters, P De Causmaecker
Computers & Operations Research 150, 106070, 2023
82023
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
J Jooken, P Leyman, P De Causmaecker
European Journal of Operational Research, 2023
52023
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs
J Jooken, P Leyman, P De Causmaecker
Journal of Heuristics 26 (5), 743-769, 2020
52020
Critical -Free Graphs
W Xia, J Jooken, J Goedgebeur, S Huang
International Conference on Combinatorial Optimization and Applications, 390-402, 2023
42023
Evolving test instances of the Hamiltonian completion problem
T Lechien, J Jooken, P De Causmaecker
Computers & Operations Research, 2022
42022
Few hamiltonian cycles in graphs with one or two vertex degrees
J Goedgebeur, J Jooken, OHS Lo, B Seamone, C Zamfirescu
Mathematics of Computation, 2024
22024
The maximum number of connected sets in regular graphs
S Cambie, J Goedgebeur, J Jooken
arXiv preprint arXiv:2311.00075, 2023
12023
Developing Heuristic Algorithms for Graph Optimisation Problems using Tree Decompositions
L Carpentier, J Jooken, J Goedgebeur
36th annual meeting of the Belgian Operational Research Society, Location …, 2022
12022
Some Results on Critical ()-free Graphs
W Xia, J Jooken, J Goedgebeur, S Huang
arXiv preprint arXiv:2403.05611, 2024
2024
Exhaustive generation of edge-girth-regular graphs
J Goedgebeur, J Jooken
arXiv preprint arXiv:2401.08271, 2024
2024
A note on -coloring and -coloring 4-regular graphs
J Jooken
arXiv preprint arXiv:2401.05510, 2024
2024
A heuristic algorithm using tree decompositions for the maximum happy vertices problem
L Carpentier, J Jooken, J Goedgebeur
Journal of Heuristics, 1-41, 2023
2023
Counterexamples to conjectures on the occupancy fraction of graphs
S Cambie, J Jooken
arXiv preprint arXiv:2311.05542, 2023
2023
Improved asymptotic upper bounds for the minimum number of pairwise distinct longest cycles in regular graphs
J Jooken
arXiv preprint arXiv:2310.17469, 2023
2023
Monte Carlo Tree Search and Instance Space Analysis for the 0-1 Knapsack Problem
J Jooken, P De Causmaecker, P Leyman, J Goedgebeur, T Wauters
2023
What makes a 0-1 knapsack problem instance hard?
J Jooken, P Leyman, P De Causmaecker
37th annual meeting of the Belgian Operational Research Society, Location …, 2023
2023
A heuristic algorithm for the maximum happy vertices problem using tree decompositions
L Carpentier, J Jooken, J Goedgebeur
arXiv preprint arXiv:2208.14921, 2022
2022
Few hamiltonian cycles in graphs with one or two vertex degrees
J Goedgebeur, J Jooken, OHS Lo, B Seamone, CT Zamfirescu
Combinatorial Algorithms and Algorithmic Graph Theory (CAAGT) Seminar …, 2022
2022
New hard 0-1 knapsack problem instances
J Jooken, P Leyman, P De Causmaecker
32nd European Conference on Operational Research. Location: Espoo, Finland., 2022
2022
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20