Theis, DirkUniversität HeidelbergHeidelberg
Refine publication list
Year of publication
Type of Publication
Language
Co-author (Univ. of Heidelberg)
Co-author (external)
Publications in heiBIB 
- Reinelt, Gerhard: Computing finest mincut partitions of a graph and application to routing problems / Gerhard Reinelt ; Dirk Oliver Theis ; Klaus Michael Wenger. - 12 S.
In: Discrete applied mathematics, ISSN 1872-6771. 156(2008), 3, S. 385-396
DOI: 10.1016/j.dam.2007.03.022
- Reinelt, Gerhard: On the general routing polytope / Gerhard Reinelt ; Dirk Oliver Theis. - 17 S.
In: Discrete applied mathematics, ISSN 1872-6771. 156(2008), 3, S. 368-384
DOI: 10.1016/j.dam.2007.04.025
- Letchford, Adam N.: Odd minimum cut-sets and b-matchings revisited / Latchford, Adam N. ; Reinelt, Gerhard ; Theis, Dirk Oliver. - 8 S.
In: SIAM journal on discrete mathematics, ISSN 1095-7146. 22(2008), 4, S. 1480-1487
DOI: 10.1137/060664793
- Oswald, Marcus: On the graphical relaxation of the symmetric traveling salesman polytope / Marcus Oswald ; Gerhard Reinelt ; Dirk Oliver Theis. - 19 S.
In: Mathematical programming, ISSN 1436-4646. 110(2007), 1, S. 175-193
DOI: 10.1007/s10107-006-0060-x
- Reinelt, Gerhard: A note on the undirected rural postman problem polytope / Gerhard Reinelt ; Dirk Oliver Theis. - 6 S.
In: Mathematical programming, ISSN 1436-4646. 106(2006), 3, S. 447-452
DOI: 10.1007/s10107-005-0640-1
- Oswald, Marcus: Not every GTSP facet induces an STSP facet / Marcus Oswald ; Dirk Oliver Theis, Gerhard Reinelt. - 15 S.
In: Integer programming and combinatorial optimization. (2005), S. 468-482
- Reinelt, Gerhard: Transformation of facets of the general routing problem / Gerhard Reinelt ; Dirk Oliver Theis. - 15 S.
In: SIAM journal on optimization, ISSN 1095-7189. 16(2005), 1, S. 220-234
DOI: 10.1137/040607307
- Theis, Dirk: Polyhedra and algorithms for the general routing problem / Dirk Oliver Theis, 2005. - Online-Ressource
- Theis, Dirk: Polyhedra and algorithms for the general routing problem / vorgelegt von Dirk Oliver Theis, 2005. - XII, 200 S. : Ill., graph. Darst.
- Letchford, Adam N.: A faster exact separation algorithm for blossom inequalities / Adam N. Letchford ; Dirk O. Theis ; Gerhard Reinelt. - 10 S.
In: Integer Programming and Combinatorial Optimization. (2004), S. 196-205
