The following pages link to T. Wauters (Q296908):
Displaying 22 items.
- Decomposition and local search based methods for the traveling umpire problem (Q296910) (← links)
- The multi-mode resource-constrained multi-project scheduling problem, The MISTA 2013 challenge (Q310341) (← links)
- Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem (Q322545) (← links)
- An effective shaking procedure for 2D and 3D strip packing problems (Q336597) (← links)
- The concrete delivery problem (Q337044) (← links)
- Stochastic local search with learning automaton for the swap-body vehicle routing problem (Q1652446) (← links)
- Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem (Q1752837) (← links)
- Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems (Q2003558) (← links)
- A learning-based optimization approach to multi-project scheduling (Q2018943) (← links)
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation (Q2116899) (← links)
- A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints (Q2140189) (← links)
- The prisoner transportation problem (Q2178139) (← links)
- Multi-machine energy-aware scheduling (Q2397770) (← links)
- Extracting maximal objects from three-dimensional solid materials (Q2668729) (← links)
- The one-dimensional cutting stock problem with sequence-dependent cut losses (Q2803252) (← links)
- A guide-and-observe hyper-heuristic approach to the Eternity II puzzle (Q5891176) (← links)
- A guide-and-observe hyper-heuristic approach to the Eternity II puzzle (Q5919987) (← links)
- The exam location problem: mathematical formulations and variants (Q6065634) (← links)
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q6351966) (← links)
- Instance space analysis for 2D bin packing mathematical models (Q6554643) (← links)
