2009 |
30 | EE | Marcus Oswald,
Gerhard Reinelt:
The simultaneous consecutive ones problem.
Theor. Comput. Sci. 410(21-23): 1986-1992 (2009) |
2008 |
29 | EE | Gerhard Reinelt,
Dirk Oliver Theis:
On the general routing polytope.
Discrete Applied Mathematics 156(3): 368-384 (2008) |
28 | 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) |
27 | EE | János Balogh,
József Békési,
Gábor Galambos,
Gerhard Reinelt:
Lower Bound for the Online Bin Packing Problem with Restricted Repacking.
SIAM J. Comput. 38(1): 398-410 (2008) |
2007 |
26 | EE | Frank Noé,
Marcus Oswald,
Gerhard Reinelt:
Optimizing in Graphs with Expensive Computation of Edge Weights.
OR 2007: 435-440 |
25 | EE | Jonghyun Suh,
Sungwon Jung,
Martin Pfeifle,
Khoa T. Vo,
Marcus Oswald,
Gerhard Reinelt:
Compression of Digital Road Networks.
SSTD 2007: 423-440 |
24 | 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 |
23 | EE | Gunnar Schramm,
Marcus Oswald,
Hanna Seitz,
Sebastian Sager,
Marc Zapatka,
Gerhard Reinelt,
Roland Eils,
Rainer König:
Pattern recognition of gene expression data on biochemical networks with simple wavelet transforms.
LWA 2006: 350-355 |
22 | EE | Rainer König,
Gunnar Schramm,
Marcus Oswald,
Hanna Seitz,
Sebastian Sager,
Marc Zapatka,
Gerhard Reinelt,
Roland Eils:
Discovering functional gene expression patterns in the metabolic network of Escherichia coli with wavelets transforms.
BMC Bioinformatics 7: 119 (2006) |
21 | EE | Dino Ahr,
Gerhard Reinelt:
A tabu search algorithm for the min-max k-Chinese postman problem.
Computers & OR 33(12): 3403-3422 (2006) |
20 | EE | Gerhard Reinelt,
Dirk Oliver Theis:
A note on the Undirected Rural Postman Problem polytope.
Math. Program. 106(3): 447-452 (2006) |
2005 |
19 | EE | Marcus Oswald,
Gerhard Reinelt,
Dirk Oliver Theis:
Not Every GTSP Facet Induces an STSP Facet.
IPCO 2005: 468-482 |
18 | EE | Cara Cocking,
Steffen Flessa,
Gerhard Reinelt:
Locating Health Facilities in Nouna District, Burkina Faso.
OR 2005: 431-436 |
2004 |
17 | EE | Adam N. Letchford,
Gerhard Reinelt,
Dirk Oliver Theis:
A Faster Exact Separation Algorithm for Blossom Inequalities.
IPCO 2004: 196-205 |
16 | EE | Gerhard Reinelt:
Book review.
Oper. Res. Lett. 32(5): 497-498 (2004) |
2003 |
15 | | Michael Jünger,
Gerhard Reinelt,
Giovanni Rinaldi:
Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds, 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers
Springer 2003 |
14 | EE | Marcus Oswald,
Gerhard Reinelt:
The weighted consecutive ones problem for a fixed number of rows or columns.
Oper. Res. Lett. 31(3): 350-356 (2003) |
2002 |
13 | EE | Dino Ahr,
Gerhard Reinelt:
New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem.
ESA 2002: 64-74 |
2001 |
12 | EE | Marcus Oswald,
Gerhard Reinelt:
Constructing New Facets of the Consecutive Ones Polytope.
Combinatorial Optimization 2001: 147-157 |
11 | EE | Thomas Christof,
Gerhard Reinelt:
Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut.
Algorithmica 30(4): 597-629 (2001) |
10 | | Thomas Christof,
Gerhard Reinelt:
Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes.
Int. J. Comput. Geometry Appl. 11(4): 423-437 (2001) |
2000 |
9 | EE | Marcus Oswald,
Gerhard Reinelt:
Polyhedral Aspects of the Consecutive Ones Problem.
COCOON 2000: 373-382 |
1998 |
8 | EE | Thomas Christof,
Marcus Oswald,
Gerhard Reinelt:
Consecutive Ones and a Betweenness Problem in Computational Biology.
IPCO 1998: 213-228 |
1997 |
7 | EE | Thomas Christof,
Michael Jünger,
John D. Kececioglu,
Petra Mutzel,
Gerhard Reinelt:
A branch-and-cut approach to physical mapping with end-probes.
RECOMB 1997: 84-92 |
6 | | Thomas Christof,
Michael Jünger,
John D. Kececioglu,
Petra Mutzel,
Gerhard Reinelt:
A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes.
Journal of Computational Biology 4(4): 433-448 (1997) |
1996 |
5 | | Meinrad Funke,
Gerhard Reinelt:
A Polyhedral Approach to the Feedback Vertex Set Problem.
IPCO 1996: 445-459 |
1994 |
4 | | Gerhard Reinelt:
The Traveling Salesman, Computational Solutions for TSP Applications
Springer 1994 |
3 | | Michael Jünger,
Alexander Martin,
Gerhard Reinelt,
Robert Weismantel:
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits.
Math. Program. 63: 257-279 (1994) |
1993 |
2 | | Gerhard Reinelt:
A Note on Small Linear-Ordering Polytopes.
Discrete & Computational Geometry 10: 67-78 (1993) |
1990 |
1 | | Gerhard Reinelt:
Polyedrische Methoden zur Lösung großer kombinatorischer Optimierungsprobleme.
GI Jahrestagung (2) 1990: 517-526 |