Pages that link to "Item:Q284423"
From MaRDI portal
The following pages link to Integer programming techniques for the nurse rostering problem (Q284423):
Displaying 23 items.
- An assessment of a days off decomposition approach to personnel shift scheduling (Q284419) (← links)
- A hybrid integer and constraint programming approach to solve nurse rostering problems (Q1652269) (← links)
- Variable neighborhood search accelerated column generation for the nurse rostering problem (Q1687629) (← links)
- Simulated annealing approach to nurse rostering benchmark and real-world instances (Q1730622) (← links)
- The second international nurse rostering competition (Q1730710) (← links)
- Integer programming model extensions for a multi-stage nurse rostering problem (Q1730747) (← links)
- Integer programming techniques for educational timetabling (Q1754009) (← links)
- A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem (Q1983752) (← links)
- A scenario-based robust optimization with a pessimistic approach for nurse rostering problem (Q2025104) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- A flexible mixed integer programming-based system for real-world nurse rostering (Q2124911) (← links)
- A rotation-based branch-and-price approach for the nurse scheduling problem (Q2220898) (← links)
- An integer programming approach for the physician rostering problem (Q2241148) (← links)
- Modelling history in nurse rostering (Q2241149) (← links)
- A graph-based formulation for the shift rostering problem (Q2301967) (← links)
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)
- Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
- Optimal duty rostering for toll enforcement inspectors (Q2398431) (← links)
- First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem (Q2664285) (← links)
- A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem (Q2668655) (← links)
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
- Optimal decision trees for the algorithm selection problem: integer programming based approaches (Q6092614) (← links)
- A fix-and-optimize heuristic for the unrelated parallel machine scheduling problem (Q6551102) (← links)