Papers › Structural Insights and an IP-based Solution Method for Patient-to-room Assignment...
Structural Insights and an IP-based Solution Method for Patient-to-room Assignment under Consideration of Single Room Entitlements
Tabea Brandt, Christina Büsing, Felix Engelhardt
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Patient-to-room assignment (PRA) is a scheduling problem in decision support for hospitals. It consists of assigning patients to rooms according to certain objectives, e.g., avoiding transfers and respecting single-room requests. This work presents combinatorial insights about the feasibility of PRA and about the assignment of patients to single rooms. We further compare different IP-formulations for PRA as well as the influence of different objectivs on the runtime. Based on these results, we develop a fast IP-based solution approach which obtains high quality solution. The applicability is verified through a computational study with instances derived from real-world data. Results indicate that large, real world instances can be solved to a high degree of optimality within (fractions of) seconds.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections