 | 2009 |
| 34 |  | József Békési,
Gábor Galambos,
Marcus Oswald,
Gerhard Reinelt:
Improved analysis of an algorithm for the coupled task problem with UET jobs.
Oper. Res. Lett. 37(2): 93-96 (2009) |
| 33 |  | Marcus Oswald,
Gerhard Reinelt:
The simultaneous consecutive ones problem.
Theor. Comput. Sci. 410(21-23): 1986-1992 (2009) |
| 2008 |
| 32 |  | Gerhard Reinelt,
Dirk Oliver Theis:
On the general routing polytope.
Discrete Applied Mathematics 156(3): 368-384 (2008) |
| 31 |  | 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) |
| 30 |  | 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 |
| 29 |  | Frank Noé,
Marcus Oswald,
Gerhard Reinelt:
Optimizing in Graphs with Expensive Computation of Edge Weights.
OR 2007: 435-440 |
| 28 |  | Jonghyun Suh,
Sungwon Jung,
Martin Pfeifle,
Khoa T. Vo,
Marcus Oswald,
Gerhard Reinelt:
Compression of Digital Road Networks.
SSTD 2007: 423-440 |
| 27 |  | 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 |
| 26 |  | 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 |
| 25 |  | 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) |
| 24 |  | Dino Ahr,
Gerhard Reinelt:
A tabu search algorithm for the min-max k-Chinese postman problem.
Computers & OR 33(12): 3403-3422 (2006) |
| 23 |  | Gerhard Reinelt,
Klaus Michael Wenger:
Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem.
INFORMS Journal on Computing 18(4): 466-479 (2006) |
| 22 |  | Gerhard Reinelt,
Dirk Oliver Theis:
A note on the Undirected Rural Postman Problem polytope.
Math. Program. 106(3): 447-452 (2006) |
| 2005 |
| 21 |  | Marcus Oswald,
Gerhard Reinelt,
Dirk Oliver Theis:
Not Every GTSP Facet Induces an STSP Facet.
IPCO 2005: 468-482 |
| 20 |  | Cara Cocking,
Steffen Flessa,
Gerhard Reinelt:
Locating Health Facilities in Nouna District, Burkina Faso.
OR 2005: 431-436 |
| 2004 |
| 19 |  | Adam N. Letchford,
Gerhard Reinelt,
Dirk Oliver Theis:
A Faster Exact Separation Algorithm for Blossom Inequalities.
IPCO 2004: 196-205 |
| 18 |  | Gerhard Reinelt:
Book review.
Oper. Res. Lett. 32(5): 497-498 (2004) |
| 2003 |
| 17 |  | 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 |
| 16 |  | 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 |
| 15 |  | Dino Ahr,
Gerhard Reinelt:
New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem.
ESA 2002: 64-74 |
| 2001 |
| 14 |  | Marcus Oswald,
Gerhard Reinelt:
Constructing New Facets of the Consecutive Ones Polytope.
Combinatorial Optimization 2001: 147-157 |
| 13 |  | Thomas Christof,
Gerhard Reinelt:
Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut.
Algorithmica 30(4): 597-629 (2001) |
| 12 |  | 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 |
| 11 |  | Marcus Oswald,
Gerhard Reinelt:
Polyhedral Aspects of the Consecutive Ones Problem.
COCOON 2000: 373-382 |
| 1998 |
| 10 |  | Thomas Christof,
Marcus Oswald,
Gerhard Reinelt:
Consecutive Ones and a Betweenness Problem in Computational Biology.
IPCO 1998: 213-228 |
| 1997 |
| 9 |  | 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 |
| 8 |  | 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 |
| 7 |  | Meinrad Funke,
Gerhard Reinelt:
A Polyhedral Approach to the Feedback Vertex Set Problem.
IPCO 1996: 445-459 |
| 1994 |
| 6 |  | Gerhard Reinelt:
The Traveling Salesman, Computational Solutions for TSP Applications
Springer 1994 |
| 5 |  | 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 |
| 4 |  | Gerhard Reinelt:
A Note on Small Linear-Ordering Polytopes.
Discrete & Computational Geometry 10: 67-78 (1993) |
| 1992 |
| 3 |  | Gerhard Reinelt:
Fast Heuristics for Large Geometric Traveling Salesman Problems.
INFORMS Journal on Computing 4(2): 206-217 (1992) |
| 1991 |
| 2 |  | Gerhard Reinelt:
TSPLIB - A Traveling Salesman Problem Library.
INFORMS Journal on Computing 3(4): 376-384 (1991) |
| 1990 |
| 1 |  | Gerhard Reinelt:
Polyedrische Methoden zur Lösung großer kombinatorischer Optimierungsprobleme.
GI Jahrestagung (2) 1990: 517-526 |