Pieter Leyman

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 16

Top Topics

Combinatorial Optimization

Project Scheduling

Traveling Salesman

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

Comput. Ind. Eng.

Publications

Reza Ghorbani Saber, Pieter Leyman, El-Houssaine Aghezzaf
Mixed Integer Programming for Integrated Flexible Job-Shop and Operator Scheduling in Flexible Manufacturing Systems. APMS (4) (2023)
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)
Duy-Hoang Tran, Pieter Leyman, Patrick De Causmaecker
Adaptive passenger-finding recommendation system for taxi drivers with load balancing problem. Comput. Ind. Eng. 169 (2022)
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)
Duy-Hoang Tran, Behrouz Babaki, Dries Van Daele, Pieter Leyman, Patrick De Causmaecker
Local search for constrained graph clustering in biological networks. Comput. Oper. Res. 132 (2021)
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)
Tu-San Pham, Pieter Leyman, Patrick De Causmaecker
The intermittent travelling salesman problem. Int. Trans. Oper. Res. 27 (1) (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)
Pieter Leyman, Niels Van Driessche, Mario Vanhoucke, Patrick De Causmaecker
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. 103 (2019)
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs. CoRR (2019)
Pieter Leyman, San Tu Pham, Patrick De Causmaecker
The Intermittent Traveling Salesman Problem with Different Temperature Profiles: Greedy or not? CoRR (2017)
Pieter Leyman, Mario Vanhoucke
Capital- and resource-constrained project scheduling with net present value optimization. Eur. J. Oper. Res. 256 (3) (2017)
Pieter Leyman, Patrick De Causmaecker
Optimization in large graphs: Toward a better future? CoRR (2017)
Pieter Leyman, Mario Vanhoucke
Payment models and net present value optimization for resource-constrained project scheduling. Comput. Ind. Eng. 91 (2016)