Pieter Leyman

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Efficient Algorithms for Energy-Aware Single-Machine Scheduling with Battery Storage (available as arXiv preprint)	2026-01-01	Paper
The intermittent travelling salesman problem International Transactions in Operational Research	2023-11-16	Paper
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions European Journal of Operational Research	2023-07-11	Paper
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions European Journal of Operational Research	2023-07-11	Paper
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems Computers & Operations Research	2022-12-19	Paper
A new class of hard problem instances for the 0-1 knapsack problem European Journal of Operational Research	2022-05-20	Paper
Local search for constrained graph clustering in biological networks Computers & Operations Research	2022-03-07	Paper
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (available as arXiv preprint)	2020-10-22	Paper
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 Computers & Operations Research	2018-12-17	Paper
Capital- and resource-constrained project scheduling with net present value optimization European Journal of Operational Research	2018-05-24	Paper

Research outcomes over time

This page was built for person: Pieter Leyman