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

DOI10.1016/J.DAM.2023.12.025MaRDI QIDQ6202948FDOQ6202948

Sigrid Knust, Tabea Brandt, Christina Büsing

Publication date: 27 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationcomplexitypatient-to-room assignment

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Local search and lower bounds for the patient admission scheduling problem
• The Red-Blue transportation problem
• A mixed integer programming approach to the patient admission scheduling problem
• Compatibility of short and long term objectives for dynamic patient admission scheduling
• A column generation approach for solving the patient admission scheduling problem
• Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
• The transportation problem with conflicts
• An efficient matheuristic for offline patient-to-bed assignment problems
• 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

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