Variable neighborhood search accelerated column generation for the nurse rostering problem

DOI10.1016/J.ENDM.2017.03.005zbMath1390.90396OpenAlexW2606708515MaRDI QIDQ1687629

Rafael A. M. Gomes, Túlio A. M. Toffolo, Haroldo Gambini Santos

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.03.005

zbMATH Keywords

heuristicsinteger programmingcolumn generationnurse rostering

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

A rotation-based branch-and-price approach for the nurse scheduling problem ⋮ The nurse rerostering problem: strategies for reconstructing disrupted schedules ⋮ A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem ⋮ A survey on the applications of variable neighborhood search algorithm in healthcare management ⋮ An integer programming approach for the physician rostering problem

Cites Work

• Integer programming techniques for the nurse rostering problem
• The first international nurse rostering competition 2010
• Variable neighborhood search
• The state of the art of nurse rostering
• Column Generation based Primal Heuristics
• Decomposition Principle for Linear Programs
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem

This page was built for publication: Variable neighborhood search accelerated column generation for the nurse rostering problem