Pages that link to "Item:Q475191"
From MaRDI portal
The following pages link to A variable neighborhood search based matheuristic for nurse rostering problems (Q475191):
Displayed 10 items.
- Genetic based discrete particle swarm optimization for elderly day care center timetabling (Q342133) (← links)
- Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time (Q723919) (← links)
- A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
- Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing (Q1725608) (← links)
- The second international nurse rostering competition (Q1730710) (← links)
- Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure (Q1730745) (← links)
- Staff assignment with lexicographically ordered acceptance levels (Q1743648) (← links)
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems (Q1751653) (← links)
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders (Q2307325) (← links)