Integer programming techniques for the nurse rostering problem
From MaRDI portal
Publication:284423
Recommendations
- Integer programming model extensions for a multi-stage nurse rostering problem
- A systematic two phase approach for the nurse rostering problem
- The nurse rostering problem: a critical appraisal of the problem structure
- The first international nurse rostering competition 2010
- The second international nurse rostering competition
Cites work
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- A computational study of a cutting plane algorithm for university course timetabling
- A cutting plane algorithm for graph coloring
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- A systematic two phase approach for the nurse rostering problem
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- Algorithm 457: finding all cliques of an undirected graph
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
- Conflict graphs in solving integer programming problems
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Fenchel Cutting Planes for Integer Programs
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
- Geometric algorithms and combinatorial optimization.
- Gomory cuts revisited
- Local branching
- Noncommercial software for mixed-integer linear programming
- Numerically safe Gomory mixed-integer cuts
- Nurse rostering problems -- a bibliographic survey.
- On the facial structure of set packing polyhedra
- Optimizing over the first Chvátal closure
- Reduce-and-Split cuts: improving the performance of mixed-integer Gomory cuts
- Revival of the Gomory cuts in the 1990's
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Solving \(0/1\) integer programs with enumeration cutting planes
- The first international nurse rostering competition 2010
- The state of the art of nurse rostering
- Variable neighborhood search
- Variable neighborhood search and local branching
Cited in
(25)- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem
- A graph-based formulation for the shift rostering problem
- The second international nurse rostering competition
- Simulated annealing approach to nurse rostering benchmark and real-world instances
- Integer programming techniques for educational timetabling
- A rotation-based branch-and-price approach for the nurse scheduling problem
- Optimal duty rostering for toll enforcement inspectors
- An assessment of a days off decomposition approach to personnel shift scheduling
- Variable neighborhood search accelerated column generation for the nurse rostering problem
- A fix-and-optimize heuristic for the unrelated parallel machine scheduling problem
- Preprocessing and cutting planes with conflict graphs
- Integer programming model extensions for a multi-stage nurse rostering problem
- First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem
- A flexible mixed integer programming-based system for real-world nurse rostering
- The nurse rostering problem: a critical appraisal of the problem structure
- New enhancements for the exact solution of the vehicle routing problem with time windows
- A scenario-based robust optimization with a pessimistic approach for nurse rostering problem
- An integer programming approach for the physician rostering problem
- Modelling history in nurse rostering
- A hybrid integer and constraint programming approach to solve nurse rostering problems
- Improved branch-cut-and-price for capacitated vehicle routing
- Nurse rostering problems -- a bibliographic survey.
- A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
- Optimal decision trees for the algorithm selection problem: integer programming based approaches
Describes a project that uses
Uses Software
This page was built for publication: Integer programming techniques for the nurse rostering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284423)
