| 2008 |
|---|
| 6 | EE | Gerhard Reinelt,
Dirk Oliver Theis:
On the general routing polytope.
Discrete Applied Mathematics 156(3): 368-384 (2008) |
| 5 | EE | Gerhard Reinelt,
Dirk Oliver Theis,
Klaus Michael Wenger:
Computing finest mincut partitions of a graph and application to routing problems.
Discrete Applied Mathematics 156(3): 385-396 (2008) |
| 2007 |
|---|
| 4 | EE | Marcus Oswald,
Gerhard Reinelt,
Dirk Oliver Theis:
On the graphical relaxation of the symmetric traveling salesman polytope.
Math. Program. 110(1): 175-193 (2007) |
| 2006 |
|---|
| 3 | EE | Gerhard Reinelt,
Dirk Oliver Theis:
A note on the Undirected Rural Postman Problem polytope.
Math. Program. 106(3): 447-452 (2006) |
| 2005 |
|---|
| 2 | EE | Marcus Oswald,
Gerhard Reinelt,
Dirk Oliver Theis:
Not Every GTSP Facet Induces an STSP Facet.
IPCO 2005: 468-482 |
| 2004 |
|---|
| 1 | EE | Adam N. Letchford,
Gerhard Reinelt,
Dirk Oliver Theis:
A Faster Exact Separation Algorithm for Blossom Inequalities.
IPCO 2004: 196-205 |
