One transfer per patient suffices: structural insights about patient-to-room assignment

DOI10.1007/978-3-031-18530-4_18zbMath1528.90206MaRDI QIDQ6111512

Tabea Brandt, Sigrid Knust, Christina Büsing

Publication date: 3 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationpatient-to-room assignment

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

Structural insights about avoiding transfers in the patient-to-room assignment problem

Cites Work

• 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
• An efficient matheuristic for offline patient-to-bed assignment problems
• A column generation approach for solving the patient admission scheduling problem

This page was built for publication: One transfer per patient suffices: structural insights about patient-to-room assignment