@incollection{UBHD-67300121,
  author={Letchford, Adam N. and Theis, Dirk and Reinelt, Gerhard},
  title={A faster exact separation algorithm for blossom inequalities},
  year={2004},
  pages={196-205},
  language={eng},
  isbn={3-540-22113-1 and 978-3-540-22113-5},
  booktitle={Integer Programming and Combinatorial Optimization},
}
@article{UBHD-67294175,
  author={Letchford, Adam N. and Reinelt, Gerhard and Theis, Dirk},
  title={Odd minimum cut-sets and b-matchings revisited},
  year={2008},
  pages={1480-1487},
  language={eng},
  issn={1095-7146},
  volume={22},
  number={4},
  note={Theis, Dirk Oliver in der Vorlage irrt{\"u}mlich mit Their, Dirk Oliver angegeben},
  journal={SIAM journal on discrete mathematics},
  doi={10.1137/060664793},
}
@incollection{UBHD-67300118,
  author={Oswald, Marcus and Theis, Dirk and Reinelt, Gerhard},
  title={Not every GTSP facet induces an STSP facet},
  year={2005},
  pages={468-482},
  language={eng},
  isbn={978-3-540-26199-5 and 3-540-26199-0},
  booktitle={Integer programming and combinatorial optimization},
  editor={J{\"u}nger, Michael and Kaibel, Volker},
}
@article{UBHD-67298519,
  author={Oswald, Marcus and Reinelt, Gerhard and Theis, Dirk},
  title={On the graphical relaxation of the symmetric traveling salesman polytope},
  year={2007},
  pages={175-193},
  language={eng},
  issn={1436-4646},
  volume={110},
  number={1},
  journal={Mathematical programming},
  doi={10.1007/s10107-006-0060-x},
}
@article{UBHD-67298097,
  author={Reinelt, Gerhard and Theis, Dirk and Wenger, Klaus},
  title={Computing finest mincut partitions of a graph and application to routing problems},
  year={2008},
  pages={385-396},
  language={eng},
  issn={1872-6771},
  volume={156},
  number={3},
  journal={Discrete applied mathematics},
  doi={10.1016/j.dam.2007.03.022},
}
@article{UBHD-67299573,
  author={Reinelt, Gerhard and Theis, Dirk},
  title={A note on the undirected rural postman problem polytope},
  year={2006},
  pages={447-452},
  language={eng},
  issn={1436-4646},
  volume={106},
  number={3},
  journal={Mathematical programming},
  doi={10.1007/s10107-005-0640-1},
}
@article{UBHD-67298095,
  author={Reinelt, Gerhard and Theis, Dirk},
  title={On the general routing polytope},
  year={2008},
  pages={368-384},
  language={eng},
  issn={1872-6771},
  volume={156},
  number={3},
  journal={Discrete applied mathematics},
  doi={10.1016/j.dam.2007.04.025},
}
@article{UBHD-67299574,
  author={Reinelt, Gerhard and Theis, Dirk},
  title={Transformation of facets of the general routing problem},
  year={2005},
  pages={220-234},
  language={eng},
  issn={1095-7189},
  volume={16},
  number={1},
  journal={SIAM journal on optimization},
  doi={10.1137/040607307},
}
@book{UBHD-66094161,
  author={Theis, Dirk},
  title={Polyhedra and algorithms for the general routing problem},
  year={2005},
  pages={XII, 200 S.},
  language={eng},
  note={Zsfassung in dt. Sprache},
  school={Heidelberg, Univ., Diss., 2005},
  keywords={Kombinatorische Optimierung / Polyedrische Kombinatorik},
  library={UB [Signatur: 2006 U 249] ; MA [Signatur: Diss. Theis]},
}
@book{UBHD-66223226,
  author={Theis, Dirk},
  title={Polyhedra and algorithms for the general routing problem},
  year={2005},
  pages={Online-Ressource},
  language={eng},
  school={Heidelberg, Univ., Diss., 2005},
  keywords={Kombinatorische Optimierung / Polyedrische Kombinatorik / Konvexes Polyeder / Ganzzahlige Optimierung / Graphentheoretisches Optimierungsverfahren},
  url={http://archiv.ub.uni-heidelberg.de/volltextserver/volltexte/2006/6179},
  library={UB},
}