Structural insights about avoiding transfers in the patient-to-room assignment problem
From MaRDI portal
Publication:6202948
DOI10.1016/j.dam.2023.12.025MaRDI QIDQ6202948
Sigrid Knust, Tabea Brandt, Christina Büsing
Publication date: 27 February 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- The Red-Blue transportation problem
- Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
- Local search and lower bounds for the patient admission scheduling problem
- The transportation problem with conflicts
- A mixed integer programming approach to the patient admission scheduling problem
- Compatibility of short and long term objectives for dynamic patient admission scheduling
- An efficient matheuristic for offline patient-to-bed assignment problems
- A column generation approach for solving the patient admission scheduling problem
- One transfer per patient suffices: structural insights about patient-to-room assignment
This page was built for publication: Structural insights about avoiding transfers in the patient-to-room assignment problem
