The following pages link to Pieter Leyman (Q1634071):
Displayed 8 items.
- 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 (Q1634073) (← links)
- Capital- and resource-constrained project scheduling with net present value optimization (Q1752257) (← links)
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
- A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
- Local search for constrained graph clustering in biological networks (Q2668745) (← links)
- The intermittent travelling salesman problem (Q6066722) (← links)
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q6351966) (← links)