Pieter Leyman

Orcid: 0000-0002-3452-0413

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
NICE: an algorithm for nearest instance counterfactual explanations.
Data Min. Knowl. Discov., September, 2024

2023
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions.
Eur. J. Oper. Res., November, 2023

Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems.
Comput. Oper. Res., 2023

Mixed Integer Programming for Integrated Flexible Job-Shop and Operator Scheduling in Flexible Manufacturing Systems.
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.
Eur. J. Oper. Res., 2022

Adaptive passenger-finding recommendation system for taxi drivers with load balancing problem.
Comput. Ind. Eng., 2022

2021
Local search for constrained graph clustering in biological networks.
Comput. Oper. Res., 2021

2020
The intermittent travelling salesman problem.
Int. Trans. Oper. Res., 2020

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

Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem.
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.
Comput. Oper. Res., 2019

2017
Capital- and resource-constrained project scheduling with net present value optimization.
Eur. J. Oper. Res., 2017

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

Optimization in large graphs: Toward a better future?
CoRR, 2017

2016
Payment models and net present value optimization for resource-constrained project scheduling.
Comput. Ind. Eng., 2016


  Loading...