A Cutting Plane Algorithm for the Linear Ordering Problem. - Martin Grötschel; Michael Jünger; Gerhard Reinelt (Oper. Res., 1984)

On partitioning the edges of graphs into connected subgraphs. - Michael Jünger; Gerhard Reinelt; William R. Pulleyblank (J. Graph Theory, 1985)

On the acyclic subgraph polytope. - Martin Grötschel; Michael Jünger; Gerhard Reinelt (Math. Program., 1985)

Facets of the linear ordering polytope. - Martin Grötschel; Michael Jünger; Gerhard Reinelt (Math. Program., 1985)

The linear ordering problem: algorithms and applications. - Gerhard Reinelt (Heldermann, 1985)

Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra. - Reinhardt Euler; Michael Jünger; Gerhard Reinelt (Math. Oper. Res., 1987)

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design. - Francisco Barahona; Martin Grötschel; Michael Jünger; Gerhard Reinelt (Oper. Res., 1988)

Experiments in quadratic 0-1 programming. - Francisco Barahona; Michael Jünger; Gerhard Reinelt (Math. Program., 1989)

Computing the Convex Hull in the Euclidean Plane in Linear Expected Time. - Karl Heinz Borgwardt; Norbert Gaffke; Michael Jünger; Gerhard Reinelt (Applied Geometry And Discrete Mathematics, 1990)

Polyedrische Methoden zur Lösung großer kombinatorischer Optimierungsprobleme. - Gerhard Reinelt (GI Jahrestagung (2), 1990)

Computing correct Delaunay triangulations. - Michael Jünger; Gerhard Reinelt; Doris Zepf (Computing, 1991)

TSPLIB - A Traveling Salesman Problem Library. - Gerhard Reinelt (INFORMS J. Comput., 1991)

Optimal control of plotting and drilling machines: A case study. - Martin Grötschel; Michael Jünger; Gerhard Reinelt (ZOR Methods Model. Oper. Res., 1991)

A complete description of the traveling salesman polytope on 8 nodes. - Thomas Christof; Michael Jünger; Gerhard Reinelt (Oper. Res. Lett., 1991)

Fast Heuristics for Large Geometric Traveling Salesman Problems. - Gerhard Reinelt (INFORMS J. Comput., 1992)

Practical problem solving with cutting plane algorithms in combinatorialoptimization. - Michael Jünger; Gerhard Reinelt; Stefan Thienel (Combinatorial Optimization, 1993)

A Note on Small Linear-Ordering Polytopes. - Gerhard Reinelt (Discret. Comput. Geom., 1993)

Book reviews. - M. Bischoff; Norbert Gaffke; K. Fleischmann; Gerhard Reinelt (ZOR Methods Model. Oper. Res., 1993)

The Traveling Salesman, Computational Solutions for TSP Applications - Gerhard Reinelt (Springer, 1994)

Provably good solutions for the traveling salesman problem. - Michael Jünger; Stefan Thienel; Gerhard Reinelt (Math. Methods Oper. Res., 1994)

Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. - Michael Jünger; Alexander Martin 001; Gerhard Reinelt; Robert Weismantel (Math. Program., 1994)

A Polyhedral Approach to the Feedback Vertex Set Problem. - Meinrad Funke; Gerhard Reinelt (IPCO, 1996)

A branch-and-cut approach to physical mapping with end-probes. - Thomas Christof; Michael Jünger; John D. Kececioglu; Petra Mutzel; Gerhard Reinelt (RECOMB, 1997)

A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes. - Thomas Christof; Michael Jünger; John D. Kececioglu; Petra Mutzel; Gerhard Reinelt (J. Comput. Biol., 1997)

Consecutive Ones and a Betweenness Problem in Computational Biology. - Thomas Christof; Marcus Oswald; Gerhard Reinelt (IPCO, 1998)

Polyhedral Aspects of the Consecutive Ones Problem. - Marcus Oswald; Gerhard Reinelt (COCOON, 2000)

A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. - Norbert Ascheuer; Michael Jünger; Gerhard Reinelt (Comput. Optim. Appl., 2000)

Constructing New Facets of the Consecutive Ones Polytope. - Marcus Oswald; Gerhard Reinelt (Combinatorial Optimization, 2001)

Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut. - Thomas Christof; Gerhard Reinelt (Algorithmica, 2001)

Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes. - Thomas Christof; Gerhard Reinelt (Int. J. Comput. Geom. Appl., 2001)

New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem. - Dino Ahr; Gerhard Reinelt (ESA, 2002)

Advanced Column Generation Techniques for Crew Pairing Problems. - Tran Van Hoai; Gerhard Reinelt; Hans Georg Bock (HPSC, 2003)

The weighted consecutive ones problem for a fixed number of rows or columns. - Marcus Oswald; Gerhard Reinelt (Oper. Res. Lett., 2003)

Computing Optimal Consecutive Ones Matrices. - Marcus Oswald; Gerhard Reinelt (The Sharpest Cut, 2004)

A Faster Exact Separation Algorithm for Blossom Inequalities. - Adam N. Letchford; Gerhard Reinelt; Dirk Oliver Theis (IPCO, 2004)

An exact algorithm for scheduling identical coupled tasks. - Dino Ahr; József Békési; Gábor Galambos; Marcus Oswald; Gerhard Reinelt (Math. Methods Oper. Res., 2004)

Book review. - Gerhard Reinelt (Oper. Res. Lett., 2004)

Not Every GTSP Facet Induces an STSP Facet. - Marcus Oswald; Gerhard Reinelt; Dirk Oliver Theis (IPCO, 2005)

Locating Health Facilities in Nouna District, Burkina Faso. - Cara Cocking; Steffen Flessa; Gerhard Reinelt (OR, 2005)

Transformation of Facets of the General Routing Problem Polytope. - Gerhard Reinelt; Dirk Oliver Theis (SIAM J. Optim., 2005)

Solving City Bus Scheduling Problems in Bangkok by Eligen-Algorithm. - Chotiros Surapholchai; Gerhard Reinelt; Hans Georg Bock (HPSC, 2006)

Pattern recognition of gene expression data on biochemical networks with simple wavelet transforms. - Gunnar Schramm; Marcus Oswald; Hanna Seitz; Sebastian Sager; Marc Zapatka; Gerhard Reinelt; Roland Eils; Rainer König (LWA, 2006)

Discovering functional gene expression patterns in the metabolic network of Escherichia coli with wavelets transforms. - Rainer König; Gunnar Schramm; Marcus Oswald; Hanna Seitz; Sebastian Sager; Marc Zapatka; Gerhard Reinelt; Roland Eils (BMC Bioinform., 2006)

A tabu search algorithm for the min-max k-Chinese postman problem. - Dino Ahr; Gerhard Reinelt (Comput. Oper. Res., 2006)

Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem. - Gerhard Reinelt; Klaus Michael Wenger (INFORMS J. Comput., 2006)

Computing Best Transition Pathways in High-Dimensional Dynamical Systems: Application to the AlphaL leftrightharpoons Beta leftrightharpoons AlphaR Transitions in Octaalanine. - Frank Noé; Marcus Oswald; Gerhard Reinelt; Stefan Fischer 004; Jeremy C. Smith (Multiscale Model. Simul., 2006)

A note on the Undirected Rural Postman Problem polytope. - Gerhard Reinelt; Dirk Oliver Theis (Math. Program., 2006)

Optimizing in Graphs with Expensive Computation of Edge Weights. - Frank Noé; Marcus Oswald; Gerhard Reinelt (OR, 2007)

Compression of Digital Road Networks. - Jonghyun Suh; Sungwon Jung; Martin Pfeifle; Khoa T. Vo; Marcus Oswald; Gerhard Reinelt (SSTD, 2007)

On the graphical relaxation of the symmetric traveling salesman polytope. - Marcus Oswald; Gerhard Reinelt; Dirk Oliver Theis (Math. Program., 2007)

On the general routing polytope. - Gerhard Reinelt; Dirk Oliver Theis (Discret. Appl. Math., 2008)

Computing finest mincut partitions of a graph and application to routing problems. - Gerhard Reinelt; Dirk Oliver Theis; Klaus Michael Wenger (Discret. Appl. Math., 2008)

Lower Bound for the Online Bin Packing Problem with Restricted Repacking. - János Balogh; József Békési; Gábor Galambos; Gerhard Reinelt (SIAM J. Comput., 2008)

Odd Minimum Cut Sets and b-Matchings Revisited. - Adam N. Letchford; Gerhard Reinelt; Dirk Oliver Theis (SIAM J. Discret. Math., 2008)

Analyzing the regulation of metabolic pathways in human breast cancer. - Eva-Maria Surmann; Gunnar Schramm; Stefan Wiesberg; Marcus Oswald; Gerhard Reinelt; Roland Eils; Rainer König (LWA, 2009)

Reconstructing nonlinear dynamic models of gene regulation using stochastic sampling. - Johanna Mazur; Daniel Ritter 001; Gerhard Reinelt; Lars Kaderali (BMC Bioinform., 2009)

Direct methods with maximal lower bound for mixed-integer optimal control problems. - Sebastian Sager; Hans Georg Bock; Gerhard Reinelt (Math. Program., 2009)

Improved analysis of an algorithm for the coupled task problem with UET jobs. - József Békési; Gábor Galambos; Marcus Oswald; Gerhard Reinelt (Oper. Res. Lett., 2009)

The simultaneous consecutive ones problem. - Marcus Oswald; Gerhard Reinelt (Theor. Comput. Sci., 2009)

Solving the Earth Observing Satellite Constellation Scheduling Problem by Branch-and-Price. - Pei Wang; Gerhard Reinelt (OR, 2010)

PathWave: discovering patterns of differentially regulated enzymes in metabolic pathways. - Gunnar Schramm; Stefan Wiesberg; Nicolle Diessl; Anna-Lena Kranz; Vitalia Sagulenko; Marcus Oswald; Gerhard Reinelt; Frank Westermann; Roland Eils; Rainer König (Bioinform., 2010)

Generating partitions of a graph into a fixed number of minimum weight cuts. - Gerhard Reinelt; Klaus Michael Wenger (Discret. Optim., 2010)

A Heuristic for an Earth Observing Satellite Constellation Scheduling Problem with Download Considerations. - Pei Wang; Gerhard Reinelt (Electron. Notes Discret. Math., 2010)

Traces of the XII Aussois Workshop on Combinatorial Optimization. - Michael Jünger; Thomas M. Liebling; Denis Naddef; William R. Pulleyblank; Gerhard Reinelt; Giovanni Rinaldi; Laurence A. Wolsey (Math. Program., 2010)

Globally Optimal Image Partitioning by Multicuts. - Jörg H. Kappes; Markus Speth; Björn Andres; Gerhard Reinelt; Christoph Schnörr (EMMCVPR, 2011)

A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation. - Pei Wang; Gerhard Reinelt; Peng Gao; Yuejin Tan (Comput. Ind. Eng., 2011)

A Branch and Cut solver for the maximum stable set problem. - Steffen Rebennack; Marcus Oswald; Dirk Oliver Theis; Hanna Seitz; Gerhard Reinelt; Panos M. Pardalos (J. Comb. Optim., 2011)

Optimal linear arrangements using betweenness variables. - Alberto Caprara; Marcus Oswald; Gerhard Reinelt; Robert Schwarz; Emiliano Traversi (Math. Program. Comput., 2011)

A benchmark library and a comparison of heuristic methods for the linear ordering problem. - Rafael Martí; Gerhard Reinelt; Abraham Duarte (Comput. Optim. Appl., 2012)

Exact solution of the 2-dimensional grid arrangement problem. - Marcus Oswald; Gerhard Reinelt; Stefan Wiesberg (Discret. Optim., 2012)

A tutorial on branch and cut algorithms for the maximum stable set problem. - Steffen Rebennack; Gerhard Reinelt; Panos M. Pardalos (Int. Trans. Oper. Res., 2012)

New results on the Windy Postman Problem. - Angel Corberán; Marcus Oswald; Isaac Plana; Gerhard Reinelt; José M. Sanchis (Math. Program., 2012)

Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization. - Jörg Hendrik Kappes; Markus Speth; Gerhard Reinelt; Christoph Schnörr (CVPR, 2013)

A Flow Formulation for the Optimum Communication Spanning Tree. - Elena Fernández; Carlos Luna-Mota; Achim Hildenbrandt; Gerhard Reinelt; Stefan Wiesberg (Electron. Notes Discret. Math., 2013)

Network topology-based detection of differential gene regulation and regulatory switches in cell metabolism and signaling. - Rosario M. Piro; Stefan Wiesberg; Gunnar Schramm; Nico Rebel; Marcus Oswald; Roland Eils; Gerhard Reinelt; Rainer König (BMC Syst. Biol., 2014)

On-line bin packing with restricted repacking. - János Balogh; József Békési; Gábor Galambos; Gerhard Reinelt (J. Comb. Optim., 2014)

A branch-and-bound algorithm for the coupled task problem. - József Békési; Gábor Galambos; Michael N. Jung; Marcus Oswald; Gerhard Reinelt (Math. Methods Oper. Res., 2014)

Lifting and separation procedures for the cut polytope. - Thorsten Bonato; Michael Jünger; Gerhard Reinelt; Giovanni Rinaldi (Math. Program., 2014)

A Convex Relaxation Approach to the Affine Subspace Clustering Problem. - Francesco Silvestri 002; Gerhard Reinelt; Christoph Schnörr (GCPR, 2015)

PANDA: a software for polyhedral transformations. - Stefan Lörwald; Gerhard Reinelt (EURO J. Comput. Optim., 2015)

Evaluating the quality of image matrices in blockmodeling. - Stefan Wiesberg; Gerhard Reinelt (EURO J. Comput. Optim., 2015)

Inter Programming Models for the Target Visitation Problem. - Achim Hildenbrandt; Gerhard Reinelt (Informatica (Slovenia), 2015)

Relaxations in Practical Clustering and Blockmodeling. - Stefan Wiesberg; Gerhard Reinelt (Informatica (Slovenia), 2015)

The Lagrangian relaxation for the combinatorial integral approximation problem. - Michael N. Jung; Gerhard Reinelt; Sebastian Sager (Optim. Methods Softw., 2015)

Symmetry-free SDP Relaxations for Affine Subspace Clustering. - Francesco Silvestri 002; Gerhard Reinelt; Christoph Schnörr (CoRR, 2016)

Higher-order segmentation via multicuts. - Jörg Hendrik Kappes; Markus Speth; Gerhard Reinelt; Christoph Schnörr (Comput. Vis. Image Underst., 2016)

A First Derivative Potts Model for Segmentation and Denoising Using ILP. - Ruobing Shen; Gerhard Reinelt; Stéphane Canu (OR, 2017)

A First Derivative Potts Model for Segmentation and Denoising Using MILP. - Ruobing Shen; Gerhard Reinelt; Stéphane Canu (CoRR, 2017)

An ILP Solver for Multi-label MRFS with Connectivity Constraints. - Ruobing Shen; Eric Kendinibilir; Ismail Ben Ayed; Andrea Lodi 001; Andrea Tramontani; Gerhard Reinelt (CoRR, 2017)

Priority-based and conflict-avoidance heuristics for multi-satellite scheduling. - Xiaoyu Chen 002; Gerhard Reinelt; Guangming Dai; Maocai Wang (Appl. Soft Comput., 2018)

Discrete Potts Model for Generating Superpixels on Noisy Images. - Ruobing Shen; Xiaoyu Chen 002; Xiangrui Zheng; Gerhard Reinelt (CoRR, 2018)

A Semi-Analytical Method for Periodic Earth Coverage Satellites Optimization. - Xiaoyu Chen 002; Guangming Dai; Gerhard Reinelt; Maocai Wang (IEEE Commun. Lett., 2018)

Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs. - Michael Jünger; Elisabeth Lobe; Petra Mutzel; Gerhard Reinelt; Franz Rendl; Giovanni Rinaldi; Tobias Stollenwerk (CoRR, 2019)

A mixed integer linear programming model for multi-satellite scheduling. - Xiaoyu Chen 002; Gerhard Reinelt; Guangming Dai; Andreas Spitz (Eur. J. Oper. Res., 2019)

Quantum Annealing versus Digital Computing: An Experimental Comparison. - Michael Jünger; Elisabeth Lobe; Petra Mutzel; Gerhard Reinelt; Franz Rendl; Giovanni Rinaldi; Tobias Stollenwerk (ACM J. Exp. Algorithmics, 2021)

Comments on "An Exact Method for the Minimum Feedback Arc Set Problem". - Martin Grötschel; Michael Jünger; Gerhard Reinelt (ACM J. Exp. Algorithmics, 2022)

PACE Solver Description: Exact Solution of the One-Sided Crossing Minimization Problem by the MPPEG Team. - Michael Jünger; Paul J. Jünger; Petra Mutzel; Gerhard Reinelt (IPEC, 2024)

PACE2024. - Michael Jünger; Paul J. Jünger; Petra Mutzel; Gerhard Reinelt (DROPS Artifacts, 2024)