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{Dahms:706540,
      author       = {Dahms, Florian H. W.},
      othercontributors = {Koster, Arie Marinus and Krumke, Sven O. and Lübbecke,
                          Marco},
      title        = {{D}ecomposition of {I}nteger {P}rograms with {M}atchability
                      {S}tructure},
      school       = {RWTH Aachen University},
      type         = {Dissertation},
      address      = {Aachen},
      publisher    = {Lehrstuhl für Operations Research},
      reportid     = {RWTH-2017-08718},
      pages        = {1 Online-Ressource (xii, 179 Seiten) : Illustrationen,
                      Diagramme},
      year         = {2017},
      note         = {Veröffentlicht auf dem Publikationsserver der RWTH Aachen
                      University 2017; Dissertation, RWTH Aachen University, 2016},
      abstract     = {The topic of the thesis are combinatorial optimization
                      problems which have a matching problem as substructure. The
                      following problems do have such a structure and are
                      investigated in the thesis: the curriculum based time
                      tabling problem, the multiple knapsack problem, the list
                      coloring problem, a machine scheduling problem and a special
                      railway shunting problem.It is shown, how the partial
                      transversal polytope can be helpful in decomposing large
                      integer programs into smaller sub problems. This
                      decomposition can be seen as a Benders' decomposition. The
                      theory of partial transversals is used to make the
                      algorithms more efficient and numerically stable. The
                      curriculum based time tabling problem is taken as an example
                      for these algorithms. Here it is shown that even if the
                      matching problem is based on hyper graph matchings, they can
                      be solved within an acceptable time span using the
                      algorithms of the thesis.For optimization problems which can
                      be decomposed using Dantzig-Wolfe decomposition, the theory
                      of the partial transversal is used to show that even non
                      identical subproblems can be aggregated.},
      cin          = {113320 / 110000 / 813310},
      ddc          = {510},
      cid          = {$I:(DE-82)113320_20140620$ / $I:(DE-82)110000_20140620$ /
                      $I:(DE-82)813310_20140620$},
      typ          = {PUB:(DE-HGF)11},
      doi          = {10.18154/RWTH-2017-08718},
      url          = {https://publications.rwth-aachen.de/record/706540},
}