Follow
Pieter Leyman
Title
Cited by
Cited by
Year
A new scheduling technique for the resource–constrained project scheduling problem with discounted cash flows
P Leyman, M Vanhoucke
International Journal of Production Research 53 (9), 2771-2786, 2015
662015
Payment models and net present value optimization for resource-constrained project scheduling
P Leyman, M Vanhoucke
Computers & Industrial Engineering 91, 139-153, 2016
652016
Capital-and resource-constrained project scheduling with net present value optimization
P Leyman, M Vanhoucke
European Journal of Operational Research 256 (3), 757-776, 2017
612017
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
P Leyman, N Van Driessche, M Vanhoucke, P De Causmaecker
Computers & Operations Research 103, 184-197, 2019
332019
Nice: an algorithm for nearest instance counterfactual explanations
D Brughmans, P Leyman, D Martens
Data mining and knowledge discovery, 1-39, 2023
302023
A new class of hard problem instances for the 0–1 knapsack problem
J Jooken, P Leyman, P De Causmaecker
European Journal of Operational Research 301 (3), 841-854, 2022
192022
The intermittent travelling salesman problem
TS Pham, P Leyman, P De Causmaecker
International Transactions in Operational Research 27 (1), 525-548, 2020
112020
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
J Jooken, P Leyman, T Wauters, P De Causmaecker
Computers & Operations Research 150, 106070, 2023
82023
Local search for constrained graph clustering in biological networks
DH Tran, B Babaki, D Van Daele, P Leyman, P De Causmaecker
Computers & Operations Research 132, 105299, 2021
82021
Termination criteria for metaheuristics: Is computation time worth the time?
P Leyman, P De Causmaecker
31st Annual Meeting of the Belgian Operational Research Society (ORBEL …, 2017
72017
Adaptive passenger-finding recommendation system for taxi drivers with load balancing problem
DH Tran, P Leyman, P De Causmaecker
Computers & Industrial Engineering 169, 108187, 2022
62022
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
J Jooken, P Leyman, P De Causmaecker
European Journal of Operational Research 311 (1), 36-55, 2023
52023
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs
J Jooken, P Leyman, P De Causmaecker
Journal of Heuristics 26 (5), 743-769, 2020
52020
Heuristic algorithms for payment models in project scheduling
P Leyman
Ghent University, 2016
32016
A metaheuristic approach for an intermittent traveling salesperson problem extension
P Leyman, P De Causmaecker
Proceedings of the 13th International Conference on the Practice and Theory …, 2021
22021
Combining Optimization and Data Science: A Metaheuristic Development Framework
P Leyman, P De Causmaecker
Data Science meets Optimization workshop at Federated Artificial …, 2018
12018
What is the impact of a solution representation on metaheuristic performance?
P Leyman, P De Causmaecker
32nd Annual Meeting of the Belgian Operational Research Society (ORBEL …, 2018
12018
Capital constraints and net present value optimization in project scheduling
P Leyman, M Vanhoucke
15th International Conference on Project Management and Scheduling, 98-101, 2016
12016
Towards energy-aware daily production optimization
P Leyman, S De Vuyst
33rd European Conference on Operational Research (EURO), 2024
2024
Reducing scope 2 emissions through carbon-aware flow-shop scheduling
A Mencaroni, D Claeys, S De Vuyst, B Raa, P Leyman
33rd European Conference on Operational Research (EURO), 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–20