h1

% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@PHDTHESIS{Brandt:1016252,
      author       = {Brandt, Tabea Claudia},
      othercontributors = {Büsing, Christina Maria Katharina and Knust, Sigrid},
      title        = {{S}tructural insights and efficient algorithms for the
                      patient-to-room assignment problem with equal rooms},
      school       = {RWTH Aachen University},
      type         = {Dissertation},
      address      = {Aachen},
      publisher    = {RWTH Aachen University},
      reportid     = {RWTH-2025-06846},
      pages        = {1 Online-Ressource : Illustrationen},
      year         = {2025},
      note         = {Veröffentlicht auf dem Publikationsserver der RWTH Aachen
                      University; Dissertation, RWTH Aachen University, 2025},
      abstract     = {Hospitals are an essential part of our health care system
                      and provider of critical services. Currently, most hospitals
                      face serious challenges due to staff shortage or a tight
                      budget. Efficient planning is therefore essential in every
                      day life of hospitals. However, many planning tasks are
                      still performed manually by experienced medical staff which
                      takes up valuable time. One of those every-day tasks for
                      which no automated planning or decision support exists is
                      the assignment of patients to rooms. This so-called
                      patient-to-room assignment problem (PRA) is a fundamental
                      task in hospitals and, especially, within wards. It consists
                      of assigning patients to rooms during their stay at a
                      hospital according to certain conditions and objectives,
                      e.g., ensuring gender-separated rooms, avoiding transfers,
                      respecting single-room requests, and finding suitable
                      roommates. Over the last years, many heuristics have been
                      proposed for PRA with a large variety of different practical
                      constraints. However, a thorough investigation of the
                      problem’s structure itself has been neglected so far.
                      Additionally, the setting mostly considered in literature
                      does not fit well to the common situation in German
                      hospitals. In this thesis, we present insights about the
                      basic, underlying combinatorial problem of PRA with a focus
                      on the setting of our local hospitals. We complement our
                      combinatorial insights with an efficient solution approach
                      for PRA that solves real-world instances to a high degree of
                      optimality within seconds.},
      cin          = {125620 / 120000 / 080060},
      ddc          = {004},
      cid          = {$I:(DE-82)125620_20210528$ / $I:(DE-82)120000_20140620$ /
                      $I:(DE-82)080060_20170720$},
      pnm          = {GRK 2236 - GRK 2236: Unsicherheit und Randomisierung in
                      Algorithmen, Verifikation und Logik. (282652900) /
                      Volkswagen Freigeist StaR Care (Az. 89 738)},
      pid          = {G:(GEPRIS)282652900 / G:(Volkswagen Foundation)Az. 89 738},
      typ          = {PUB:(DE-HGF)11},
      doi          = {10.18154/RWTH-2025-06846},
      url          = {https://publications.rwth-aachen.de/record/1016252},
}