Integer programming techniques for the nurse rostering problem
From MaRDI portal
Publication:284423
DOI10.1007/s10479-014-1594-6zbMath1336.90063MaRDI QIDQ284423
Haroldo Gambini 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
90C10: Integer programming
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows, An assessment of a days off decomposition approach to personnel shift scheduling, Variable neighborhood search accelerated column generation for the nurse rostering problem, Improved branch-cut-and-price for capacitated vehicle routing, Optimal duty rostering for toll enforcement inspectors
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A systematic two phase approach for the nurse rostering problem
- The first international nurse rostering competition 2010
- Revival of the Gomory cuts in the 1990's
- Optimizing over the first Chvátal closure
- A computational study of a cutting plane algorithm for university course timetabling
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- Geometric algorithms and combinatorial optimization.
- Solving \(0/1\) integer programs with enumeration cutting planes
- Variable neighborhood search
- Nurse rostering problems -- a bibliographic survey.
- Local branching
- 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
- Gomory cuts revisited
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
- Embedding {0, ½}-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
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Fenchel Cutting Planes for Integer Programs
- On the facial structure of set packing polyhedra
- Algorithm 457: finding all cliques of an undirected graph
