A dedicated pricing algorithm to solve a large family of nurse scheduling problems with branch-and-price

DOI10.1287/IJOC.2023.0019zbMATH Open1546.90063MaRDI QIDQ6598946FDOQ6598946

Authors: Antoine Legrain, Jérémy Omer 

Publication date: 5 September 2024

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Recommendations

• A rotation-based branch-and-price approach for the nurse scheduling problem
• Nurse rostering at a Danish ward
• A generalized linear programming model for nurse scheduling
• A branch-and-price approach for integrating nurse and surgery scheduling
• New approaches to nurse rostering benchmark instances

zbMATH Keywords

decompositiondynamic programmingcolumn generationbranch-and-pricenurse schedulingsoft constraints

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

This page was built for publication: A dedicated pricing algorithm to solve a large family of nurse scheduling problems with branch-and-price

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6598946)