Pieter Leyman

According to our database, Pieter Leyman authored at least 15 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

NICE: an algorithm for nearest instance counterfactual explanations.

Dieter Brughmans, Pieter Leyman, David Martens

Data Min. Knowl. Discov., September, 2024

2023

Features for the 0-1 knapsack problem based on inclusionwise maximal solutions.

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker

Eur. J. Oper. Res., November, 2023

Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems.

Jorik Jooken, Pieter Leyman, Tony Wauters, Patrick De Causmaecker

Comput. Oper. Res., 2023

Mixed Integer Programming for Integrated Flexible Job-Shop and Operator Scheduling in Flexible Manufacturing Systems.

Reza Ghorbani Saber, Pieter Leyman, El-Houssaine Aghezzaf

Proceedings of the Advances in Production Management Systems. Production Management Systems for Responsible Manufacturing, Service, and Logistics Futures, 2023

2022

A new class of hard problem instances for the 0-1 knapsack problem.

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker

Eur. J. Oper. Res., 2022

Adaptive passenger-finding recommendation system for taxi drivers with load balancing problem.

Duy-Hoang Tran, Pieter Leyman, Patrick De Causmaecker

Comput. Ind. Eng., 2022

2021

Local search for constrained graph clustering in biological networks.

Duy-Hoang Tran, Behrouz Babaki, Dries Van Daele, Pieter Leyman, Patrick De Causmaecker

Comput. Oper. Res., 2021

2020

The intermittent travelling salesman problem.

Tu-San Pham, Pieter Leyman, Patrick De Causmaecker

Int. Trans. Oper. Res., 2020

A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs.

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker

J. Heuristics, 2020

Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem.

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker, Tony Wauters

CoRR, 2020

2019

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.

Pieter Leyman, Niels Van Driessche, Mario Vanhoucke, Patrick De Causmaecker

Comput. Oper. Res., 2019

2017

Capital- and resource-constrained project scheduling with net present value optimization.

Pieter Leyman, Mario Vanhoucke

Eur. J. Oper. Res., 2017

The Intermittent Traveling Salesman Problem with Different Temperature Profiles: Greedy or not?

Pieter Leyman, San Tu Pham, Patrick De Causmaecker

CoRR, 2017

Optimization in large graphs: Toward a better future?

Pieter Leyman, Patrick De Causmaecker

CoRR, 2017

2016

Payment models and net present value optimization for resource-constrained project scheduling.

Pieter Leyman, Mario Vanhoucke

Comput. Ind. Eng., 2016