Pieter Leyman

19 papers Journal 18Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Best Practices For Empirical Meta-Algorithmic Research: Guidelines from the COSEAL Research Network.
CoRR
Theresa Eimer, Lennart Schäpermeier, André Biedenkapp, Alexander Tornede, Lars Kotthoff, Pieter Leyman, Matthias Feurer, Katharina Eggensperger, Kaitlin Maile, Tanja Tornede, Anna Kozak, Ke Xue, Marcel Wever, Mitra Baratchi, Damir Pulatov, Heike Trautmann, Haniye Kashgarani, Marius Lindauer
2025 J jnl
Towards net-zero manufacturing: carbon-aware scheduling for GHG emissions reduction.
CoRR
Andrea Mencaroni, Pieter Leyman, Birger Raa, Stijn De Vuyst, Dieter Claeys
2024 J jnl
NICE: an algorithm for nearest instance counterfactual explanations.
Data Min. Knowl. Discov.
Dieter Brughmans, Pieter Leyman, David Martens
2023 J jnl
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems.
Comput. Oper. Res.
Jorik Jooken, Pieter Leyman, Tony Wauters, Patrick De Causmaecker
2023 J jnl
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions.
Eur. J. Oper. Res.
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
2023 — conf
Mixed Integer Programming for Integrated Flexible Job-Shop and Operator Scheduling in Flexible Manufacturing Systems.
APMS (4)
Reza Ghorbani Saber, Pieter Leyman, El-Houssaine Aghezzaf
2022 J jnl
A new class of hard problem instances for the 0-1 knapsack problem.
Eur. J. Oper. Res.
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
2022 J jnl
Adaptive passenger-finding recommendation system for taxi drivers with load balancing problem.
Comput. Ind. Eng.
Duy-Hoang Tran, Pieter Leyman, Patrick De Causmaecker
2022 J jnl
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions.
CoRR
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
2021 J jnl
Local search for constrained graph clustering in biological networks.
Comput. Oper. Res.
Duy-Hoang Tran, Behrouz Babaki, Dries Van Daele, Pieter Leyman, Patrick De Causmaecker
2020 J jnl
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs.
J. Heuristics
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
2020 J jnl
Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem.
CoRR
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker, Tony Wauters
2020 J jnl
The intermittent travelling salesman problem.
Int. Trans. Oper. Res.
Tu-San Pham, Pieter Leyman, Patrick De Causmaecker
2019 J jnl
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs.
CoRR
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
2019 J jnl
The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models.
Comput. Oper. Res.
Pieter Leyman, Niels Van Driessche, Mario Vanhoucke, Patrick De Causmaecker
2017 J jnl
Capital- and resource-constrained project scheduling with net present value optimization.
Eur. J. Oper. Res.
Pieter Leyman, Mario Vanhoucke
2017 J jnl
Optimization in large graphs: Toward a better future?
CoRR
Pieter Leyman, Patrick De Causmaecker
2017 J jnl
The Intermittent Traveling Salesman Problem with Different Temperature Profiles: Greedy or not?
CoRR
Pieter Leyman, San Tu Pham, Patrick De Causmaecker
2016 J jnl
Payment models and net present value optimization for resource-constrained project scheduling.
Comput. Ind. Eng.
Pieter Leyman, Mario Vanhoucke