The following pages link to Patrick de Causmaecker (Q222055):
Displayed 30 items.
- A study of decision support models for online patient-to-room assignment planning (Q284425) (← links)
- An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem (Q296973) (← links)
- (Q320873) (redirect page) (← links)
- Polynomially solvable personnel rostering problems (Q320874) (← links)
- A combinatorial Benders' decomposition for the lock scheduling problem (Q337348) (← links)
- The first international nurse rostering competition 2010 (Q475197) (← links)
- Modelling and evaluation issues in nurse rostering (Q475208) (← links)
- A multi-objective approach for robust airline scheduling (Q1046693) (← links)
- 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)
- Local search neighbourhoods for dealing with a novel nurse rostering model (Q1761887) (← links)
- Towards a reference model for timetabling and rostering (Q1761899) (← links)
- A learning-based optimization approach to multi-project scheduling (Q2018943) (← links)
- Evolving test instances of the Hamiltonian completion problem (Q2108108) (← 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)
- Exact and heuristic methods for placing ships in locks (Q2256280) (← links)
- Declarative local search for predicate logic (Q2326747) (← links)
- A decomposed metaheuristic approach for a real-world university timetabling problem (Q2378402) (← links)
- The state of the art of nurse rostering (Q2464436) (← links)
- Local search for constrained graph clustering in biological networks (Q2668745) (← links)
- An improved best-fit heuristic for the orthogonal strip packing problem (Q2862160) (← links)
- A memetic approach to the nurse rostering problem (Q5952118) (← links)
- The intermittent travelling salesman problem (Q6066722) (← links)
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)
- A Prediction-Based Approach for Online Dynamic Appointment Scheduling: A Case Study in Radiotherapy Treatment (Q6200160) (← links)
- Partitioning in the space of antimonotonic functions (Q6224165) (← links)
- On the number of antichains of sets in a finite universe (Q6253181) (← links)
- Intervals of Antichains and Their Decompositions (Q6270493) (← links)
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q6351966) (← links)
- A computation of D(9) using FPGA Supercomputing (Q6432305) (← links)