Gerhard Reinelt

ORCID

Publication Activity (10 Years)

Years Active: 1984-2022
Publications (10 Years): 13

Top Venues

CoRR

ACM J. Exp. Algorithmics

Informatica (Slovenia)

EURO J. Comput. Optim.

University of Augsburg, Germany (PHD)

Education History

University of Augsburg, Germany

PHD

Publications

Martin Grötschel, Michael Jünger, Gerhard Reinelt
Comments on "An Exact Method for the Minimum Feedback Arc Set Problem". ACM J. Exp. Algorithmics 27 (2022)
Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk
Quantum Annealing versus Digital Computing: An Experimental Comparison. ACM J. Exp. Algorithmics 26 (2021)
Xiaoyu Chen, Gerhard Reinelt, Guangming Dai, Andreas Spitz
A mixed integer linear programming model for multi-satellite scheduling. Eur. J. Oper. Res. 275 (2) (2019)
Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk
Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs. CoRR (2019)
Xiaoyu Chen, Gerhard Reinelt, Guangming Dai, Andreas Spitz
A Mixed Integer Linear Programming Model for Multi-Satellite Scheduling. CoRR (2018)
Ruobing Shen, Xiaoyu Chen, Xiangrui Zheng, Gerhard Reinelt
Discrete Potts Model for Generating Superpixels on Noisy Images. CoRR (2018)
Xiaoyu Chen, Guangming Dai, Gerhard Reinelt, Maocai Wang
A Semi-Analytical Method for Periodic Earth Coverage Satellites Optimization. IEEE Commun. Lett. 22 (3) (2018)
Xiaoyu Chen, Gerhard Reinelt, Guangming Dai, Maocai Wang
Priority-based and conflict-avoidance heuristics for multi-satellite scheduling. Appl. Soft Comput. 69 (2018)
Ruobing Shen, Gerhard Reinelt, Stéphane Canu
A First Derivative Potts Model for Segmentation and Denoising Using MILP. CoRR (2017)
Ruobing Shen, Gerhard Reinelt, Stéphane Canu
A First Derivative Potts Model for Segmentation and Denoising Using ILP. OR (2017)
Ruobing Shen, Eric Kendinibilir, Ismail Ben Ayed, Andrea Lodi, Andrea Tramontani, Gerhard Reinelt
An ILP Solver for Multi-label MRFS with Connectivity Constraints. CoRR (2017)
Francesco Silvestri, Gerhard Reinelt, Christoph Schnörr
Symmetry-free SDP Relaxations for Affine Subspace Clustering. CoRR (2016)
Jörg Hendrik Kappes, Markus Speth, Gerhard Reinelt, Christoph Schnörr
Higher-order segmentation via multicuts. Comput. Vis. Image Underst. 143 (2016)
Achim Hildenbrandt, Gerhard Reinelt
Inter Programming Models for the Target Visitation Problem. Informatica (Slovenia) 39 (3) (2015)
Stefan Wiesberg, Gerhard Reinelt
Evaluating the quality of image matrices in blockmodeling. EURO J. Comput. Optim. 3 (2) (2015)
Francesco Silvestri, Gerhard Reinelt, Christoph Schnörr
A Convex Relaxation Approach to the Affine Subspace Clustering Problem. GCPR (2015)
Michael N. Jung, Gerhard Reinelt, Sebastian Sager
The Lagrangian relaxation for the combinatorial integral approximation problem. Optim. Methods Softw. 30 (1) (2015)
Stefan Wiesberg, Gerhard Reinelt
Relaxations in Practical Clustering and Blockmodeling. Informatica (Slovenia) 39 (3) (2015)
Stefan Lörwald, Gerhard Reinelt
PANDA: a software for polyhedral transformations. EURO J. Comput. Optim. 3 (4) (2015)
Rosario M. Piro, Stefan Wiesberg, Gunnar Schramm, Nico Rebel, Marcus Oswald, Roland Eils, Gerhard Reinelt, Rainer König
Network topology-based detection of differential gene regulation and regulatory switches in cell metabolism and signaling. BMC Syst. Biol. 8 (2014)
János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt
On-line bin packing with restricted repacking. J. Comb. Optim. 27 (1) (2014)
Thorsten Bonato, Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi
Lifting and separation procedures for the cut polytope. Math. Program. 146 (1-2) (2014)
József Békési, Gábor Galambos, Michael N. Jung, Marcus Oswald, Gerhard Reinelt
A branch-and-bound algorithm for the coupled task problem. Math. Methods Oper. Res. 80 (1) (2014)
Jörg Hendrik Kappes, Markus Speth, Gerhard Reinelt, Christoph Schnörr
Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization. CVPR (2013)
Elena Fernández, Carlos Luna-Mota, Achim Hildenbrandt, Gerhard Reinelt, Stefan Wiesberg
A Flow Formulation for the Optimum Communication Spanning Tree. Electron. Notes Discret. Math. 41 (2013)
Jörg Hendrik Kappes, Markus Speth, Gerhard Reinelt, Christoph Schnörr
Higher-order Segmentation via Multicuts CoRR (2013)
Rafael Martí, Gerhard Reinelt, Abraham Duarte
A benchmark library and a comparison of heuristic methods for the linear ordering problem. Comput. Optim. Appl. 51 (3) (2012)
Angel Corberán, Marcus Oswald, Isaac Plana, Gerhard Reinelt, José M. Sanchis
New results on the Windy Postman Problem. Math. Program. 132 (1-2) (2012)
Marcus Oswald, Gerhard Reinelt, Stefan Wiesberg
Exact solution of the 2-dimensional grid arrangement problem. Discret. Optim. 9 (3) (2012)
Steffen Rebennack, Gerhard Reinelt, Panos M. Pardalos
A tutorial on branch and cut algorithms for the maximum stable set problem. Int. Trans. Oper. Res. 19 (1-2) (2012)
Alberto Caprara, Marcus Oswald, Gerhard Reinelt, Robert Schwarz, Emiliano Traversi
Optimal linear arrangements using betweenness variables. Math. Program. Comput. 3 (3) (2011)
Steffen Rebennack, Marcus Oswald, Dirk Oliver Theis, Hanna Seitz, Gerhard Reinelt, Panos M. Pardalos
A Branch and Cut solver for the maximum stable set problem. J. Comb. Optim. 21 (4) (2011)
Jörg H. Kappes, Markus Speth, Björn Andres, Gerhard Reinelt, Christoph Schnörr
Globally Optimal Image Partitioning by Multicuts. EMMCVPR (2011)
Pei Wang, Gerhard Reinelt, Peng Gao, Yuejin Tan
A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation. Comput. Ind. Eng. 61 (2) (2011)
Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey
Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. 124 (1-2) (2010)
Gunnar Schramm, Stefan Wiesberg, Nicolle Diessl, Anna-Lena Kranz, Vitalia Sagulenko, Marcus Oswald, Gerhard Reinelt, Frank Westermann, Roland Eils, Rainer König
PathWave: discovering patterns of differentially regulated enzymes in metabolic pathways. Bioinform. 26 (9) (2010)
Pei Wang, Gerhard Reinelt
A Heuristic for an Earth Observing Satellite Constellation Scheduling Problem with Download Considerations. Electron. Notes Discret. Math. 36 (2010)
Gerhard Reinelt, Klaus Michael Wenger
Generating partitions of a graph into a fixed number of minimum weight cuts. Discret. Optim. 7 (1-2) (2010)
Pei Wang, Gerhard Reinelt
Solving the Earth Observing Satellite Constellation Scheduling Problem by Branch-and-Price. OR (2010)
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) (2009)
Marcus Oswald, Gerhard Reinelt
The simultaneous consecutive ones problem. Theor. Comput. Sci. 410 (21-23) (2009)
Johanna Mazur, Daniel Ritter, Gerhard Reinelt, Lars Kaderali
Reconstructing nonlinear dynamic models of gene regulation using stochastic sampling. BMC Bioinform. 10 (2009)
Eva-Maria Surmann, Gunnar Schramm, Stefan Wiesberg, Marcus Oswald, Gerhard Reinelt, Roland Eils, Rainer König
Analyzing the regulation of metabolic pathways in human breast cancer. LWA (2009)
Sebastian Sager, Hans Georg Bock, Gerhard Reinelt
Direct methods with maximal lower bound for mixed-integer optimal control problems. Math. Program. 118 (1) (2009)
Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis
Odd Minimum Cut Sets and b-Matchings Revisited. SIAM J. Discret. Math. 22 (4) (2008)
Gerhard Reinelt, Dirk Oliver Theis, Klaus Michael Wenger
Computing finest mincut partitions of a graph and application to routing problems. Discret. Appl. Math. 156 (3) (2008)
Gerhard Reinelt, Dirk Oliver Theis
On the general routing polytope. Discret. Appl. Math. 156 (3) (2008)
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) (2008)
Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis
On the graphical relaxation of the symmetric traveling salesman polytope. Math. Program. 110 (1) (2007)
Frank Noé, Marcus Oswald, Gerhard Reinelt
Optimizing in Graphs with Expensive Computation of Edge Weights. OR (2007)
Jonghyun Suh, Sungwon Jung, Martin Pfeifle, Khoa T. Vo, Marcus Oswald, Gerhard Reinelt
Compression of Digital Road Networks. SSTD (2007)
Chotiros Surapholchai, Gerhard Reinelt, Hans Georg Bock
Solving City Bus Scheduling Problems in Bangkok by Eligen-Algorithm. HPSC (2006)
Frank Noé, Marcus Oswald, Gerhard Reinelt, Stefan Fischer, Jeremy C. Smith
Transitions in Octaalanine. Multiscale Model. Simul. 5 (2) (2006)
Gerhard Reinelt, Klaus Michael Wenger
Cuts for the Capacitated Vehicle-Routing Problem. INFORMS J. Comput. 18 (4) (2006)
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)
Rainer König, Gunnar Schramm, Marcus Oswald, Hanna Seitz, Sebastian Sager, Marc Zapatka, Gerhard Reinelt, Roland Eils
with wavelets transforms. BMC Bioinform. 7 (2006)
Dino Ahr, Gerhard Reinelt
-Chinese postman problem. Comput. Oper. Res. 33 (12) (2006)
Gerhard Reinelt, Dirk Oliver Theis
A note on the Undirected Rural Postman Problem polytope. Math. Program. 106 (3) (2006)
Gerhard Reinelt, Dirk Oliver Theis
Transformation of Facets of the General Routing Problem Polytope. SIAM J. Optim. 16 (1) (2005)
Cara Cocking, Steffen Flessa, Gerhard Reinelt
Locating Health Facilities in Nouna District, Burkina Faso. OR (2005)
Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis
Not Every GTSP Facet Induces an STSP Facet. IPCO (2005)
Gerhard Reinelt
Book review. Oper. Res. Lett. 32 (5) (2004)
Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis
A Faster Exact Separation Algorithm for Blossom Inequalities. IPCO (2004)
Dino Ahr, József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt
An exact algorithm for scheduling identical coupled tasks. Math. Methods Oper. Res. 59 (2) (2004)
Marcus Oswald, Gerhard Reinelt
The weighted consecutive ones problem for a fixed number of rows or columns. Oper. Res. Lett. 31 (3) (2003)
Tran Van Hoai, Gerhard Reinelt, Hans Georg Bock
Advanced Column Generation Techniques for Crew Pairing Problems. HPSC (2003)
Dino Ahr, Gerhard Reinelt
New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem. ESA (2002)
Marcus Oswald, Gerhard Reinelt
Constructing New Facets of the Consecutive Ones Polytope. Combinatorial Optimization (2001)
Thomas Christof, Gerhard Reinelt
Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes. Int. J. Comput. Geom. Appl. 11 (4) (2001)
Thomas Christof, Gerhard Reinelt
Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut. Algorithmica 30 (4) (2001)
Norbert Ascheuer, Michael Jünger, Gerhard Reinelt
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. Comput. Optim. Appl. 17 (1) (2000)
Marcus Oswald, Gerhard Reinelt
Polyhedral Aspects of the Consecutive Ones Problem. COCOON (2000)
Thomas Christof, Marcus Oswald, Gerhard Reinelt
Consecutive Ones and a Betweenness Problem in Computational Biology. IPCO (1998)
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)
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. J. Comput. Biol. 4 (4) (1997)
Meinrad Funke, Gerhard Reinelt
A Polyhedral Approach to the Feedback Vertex Set Problem. IPCO (1996)
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 (1994)
Michael Jünger, Stefan Thienel, Gerhard Reinelt
Provably good solutions for the traveling salesman problem. Math. Methods Oper. Res. 40 (2) (1994)
M. Bischoff, Norbert Gaffke, K. Fleischmann, Gerhard Reinelt
Book reviews. ZOR Methods Model. Oper. Res. 37 (3) (1993)
Michael Jünger, Gerhard Reinelt, Stefan Thienel
Practical problem solving with cutting plane algorithms in combinatorialoptimization. Combinatorial Optimization (1993)
Gerhard Reinelt
A Note on Small Linear-Ordering Polytopes. Discret. Comput. Geom. 10 (1993)
Gerhard Reinelt
Book review. ZOR Methods Model. Oper. Res. 37 (3) (1993)
Gerhard Reinelt
Fast Heuristics for Large Geometric Traveling Salesman Problems. INFORMS J. Comput. 4 (2) (1992)
Michael Jünger, Gerhard Reinelt, Doris Zepf
Computing correct Delaunay triangulations. Computing 47 (1) (1991)
Gerhard Reinelt
TSPLIB - A Traveling Salesman Problem Library. INFORMS J. Comput. 3 (4) (1991)
Thomas Christof, Michael Jünger, Gerhard Reinelt
A complete description of the traveling salesman polytope on 8 nodes. Oper. Res. Lett. 10 (9) (1991)
Martin Grötschel, Michael Jünger, Gerhard Reinelt
Optimal control of plotting and drilling machines: A case study. ZOR Methods Model. Oper. Res. 35 (1) (1991)
Gerhard Reinelt
Polyedrische Methoden zur Lösung großer kombinatorischer Optimierungsprobleme. GI Jahrestagung (2) (1990)
Karl Heinz Borgwardt, Norbert Gaffke, Michael Jünger, Gerhard Reinelt
Computing the Convex Hull in the Euclidean Plane in Linear Expected Time. Applied Geometry And Discrete Mathematics (1990)
Francisco Barahona, Michael Jünger, Gerhard Reinelt
Experiments in quadratic 0-1 programming. Math. Program. 44 (1-3) (1989)
Francisco Barahona, Martin Grötschel, Michael Jünger, Gerhard Reinelt
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design. Oper. Res. 36 (3) (1988)
Reinhardt Euler, Michael Jünger, Gerhard Reinelt
Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra. Math. Oper. Res. 12 (3) (1987)
Michael Jünger, Gerhard Reinelt, William R. Pulleyblank
On partitioning the edges of graphs into connected subgraphs. J. Graph Theory 9 (4) (1985)
Martin Grötschel, Michael Jünger, Gerhard Reinelt
On the acyclic subgraph polytope. Math. Program. 33 (1) (1985)
Martin Grötschel, Michael Jünger, Gerhard Reinelt
Facets of the linear ordering polytope. Math. Program. 33 (1) (1985)
Martin Grötschel, Michael Jünger, Gerhard Reinelt
A Cutting Plane Algorithm for the Linear Ordering Problem. Oper. Res. 32 (6) (1984)

Gerhard Reinelt.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Gerhard Reinelt