Pages that link to "Item:Q2514811"

The following pages link to New approaches to nurse rostering benchmark instances (Q2514811):

Displaying 26 items.

• A-priori upper bounds for the set covering problem (Q271942) (← links)
• An assessment of a days off decomposition approach to personnel shift scheduling (Q284419) (← links)
• Effective learning hyper-heuristics for the course timetabling problem (Q296691) (← links)
• Genetic based discrete particle swarm optimization for elderly day care center timetabling (Q342133) (← links)
• A hybrid integer and constraint programming approach to solve nurse rostering problems (Q1652269) (← links)
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
• Accelerating the branch-and-price algorithm using machine learning (Q1653391) (← links)
• The nurse rerostering problem: strategies for reconstructing disrupted schedules (Q1725622) (← links)
• Simulated annealing approach to nurse rostering benchmark and real-world instances (Q1730622) (← links)
• The second international nurse rostering competition (Q1730710) (← links)
• Modeling and solving staff scheduling with partial weighted maxSAT (Q1730743) (← links)
• Integer programming model extensions for a multi-stage nurse rostering problem (Q1730747) (← links)
• A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems (Q1751653) (← links)
• A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem (Q1983752) (← links)
• Dynamic job assignment: a column generation approach with an application to surgery allocation (Q1991107) (← 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)
• A graph-based formulation for the shift rostering problem (Q2301967) (← links)
• Solving the general employee scheduling problem (Q2333146) (← 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)
• A column generation-based algorithm for midterm nurse scheduling with specialized constraints, preference considerations, and overtime (Q2669701) (← links)
• Physician Staffing for Emergency Departments with Time-Varying Demand (Q5136082) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach (Q6106764) (← links)