18 citations · 19 across the 5 of their papers we have counts for
5 papers
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
Decades of research on the 0-1 knapsack problem led to very efficient algorithms that are able to quickly solve large problem instances to optimality. This prompted researchers to…
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
Jorik Jooken, Pieter Leyman, Tony Wauters +1
In this article we propose a heuristic algorithm to explore search space trees associated with instances of combinatorial optimization problems. The algorithm is based on Monte Car…
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
This paper proposes a local search algorithm for a specific combinatorial optimisation problem in graph theory: the Hamiltonian Completion Problem (HCP) on undirected graphs. In th…
Optimization in large graphs: Toward a better future?
Pieter Leyman, Patrick De Causmaecker
Finding groups of connected individuals in large graphs with tens of thousands or more nodes has received considerable attention in academic research. In this paper, we analyze thr…
The Intermittent Traveling Salesman Problem with Different Temperature Profiles: Greedy or not?
Pieter Leyman, San Tu Pham, Patrick De Causmaecker
In this research, we discuss the intermittent traveling salesman problem (ITSP), which extends the traditional traveling salesman problem (TSP) by imposing temperature restrictions…