Integer programming techniques for the nurse rostering problem
From MaRDI portal
Publication:284423
DOI10.1007/S10479-014-1594-6zbMATH Open1336.90063OpenAlexW2034438127MaRDI QIDQ284423FDOQ284423
Authors: Haroldo G. Santos, Túlio A. M. Toffolo, Rafael A. M. Gomes, Sabir Ribas 
Publication date: 18 May 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1594-6
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)
Cites Work
- Algorithm 457: finding all cliques of an undirected graph
- Geometric algorithms and combinatorial optimization.
- Local branching
- Gomory cuts revisited
- On the facial structure of set packing polyhedra
- Revival of the Gomory cuts in the 1990's
- Variable neighborhood search
- Title not available (Why is that?)
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- Solving \(0/1\) integer programs with enumeration cutting planes
- Nurse rostering problems -- a bibliographic survey.
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Conflict graphs in solving integer programming problems
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
- The state of the art of nurse rostering
- A cutting plane algorithm for graph coloring
- Variable neighborhood search and local branching
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Numerically safe Gomory mixed-integer cuts
- Reduce-and-Split cuts: improving the performance of mixed-integer Gomory cuts
- Noncommercial software for mixed-integer linear programming
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Fenchel Cutting Planes for Integer Programs
- A systematic two phase approach for the nurse rostering problem
- The first international nurse rostering competition 2010
- Optimizing over the first Chvátal closure
- A computational study of a cutting plane algorithm for university course timetabling
Cited In (25)
- A rotation-based branch-and-price approach for the nurse scheduling problem
- Simulated annealing approach to nurse rostering benchmark and real-world instances
- An assessment of a days off decomposition approach to personnel shift scheduling
- New enhancements for the exact solution of the vehicle routing problem with time windows
- An integer programming approach for the physician rostering problem
- Modelling history in nurse rostering
- Improved branch-cut-and-price for capacitated vehicle routing
- A scenario-based robust optimization with a pessimistic approach for nurse rostering problem
- The nurse rostering problem: a critical appraisal of the problem structure
- Preprocessing and cutting planes with conflict graphs
- Nurse rostering problems -- a bibliographic survey.
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
- First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem
- Optimal decision trees for the algorithm selection problem: integer programming based approaches
- A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem
- Integer programming model extensions for a multi-stage nurse rostering problem
- Optimal duty rostering for toll enforcement inspectors
- A flexible mixed integer programming-based system for real-world nurse rostering
- Variable neighborhood search accelerated column generation for the nurse rostering problem
- A hybrid integer and constraint programming approach to solve nurse rostering problems
- A graph-based formulation for the shift rostering problem
- The second international nurse rostering competition
- Integer programming techniques for educational timetabling
- A fix-and-optimize heuristic for the unrelated parallel machine scheduling problem
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)
