Gerhard Reinelt

发表

A tabu search algorithm for the min-max k-Chinese postman problem

Gerhard Reinelt, Dino Ahr, G. Reinelt, 2006, Comput. Oper. Res..

Heuristics for Budget Facility Location-Network Design Problems with Minisum Objective

Gerhard Reinelt, Marc E. Pfetsch, Cara Cocking, 2009 .

A Flow Formulation for the Optimum Communication Spanning Tree

Gerhard Reinelt, Achim Hildenbrandt, Elena Fernández, 2013, Electron. Notes Discret. Math..

Exact solution of the 2-dimensional grid arrangement problem

Gerhard Reinelt, Marcus Oswald, Stefan Wiesberg, 2012, Discret. Optim..

A First Derivative Potts Model for Segmentation and Denoising Using MILP pdf

Gerhard Reinelt, Stéphane Canu, Ruobing Shen, 2017, OR.

The simultaneous consecutive ones problem

Gerhard Reinelt, Marcus Oswald, 2009, Theor. Comput. Sci..

Advanced Column Generation Techniques for Crew Pairing Problems

Gerhard Reinelt, Hans Georg Bock, Tran Van Hoai, 2003, HPSC.

Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem

Gerhard Reinelt, Klaus Michael Wenger, 2006, INFORMS J. Comput..

Transformation of Facets of the General Routing Problem Polytope

Gerhard Reinelt, Dirk Oliver Theis, 2005, SIAM J. Optim..

A Heuristic for an Earth Observing Satellite Constellation Scheduling Problem with Download Considerations

Gerhard Reinelt, Pei Wang, 2010, Electron. Notes Discret. Math..

Not Every GTSP Facet Induces an STSP Facet

Gerhard Reinelt, Marcus Oswald, Dirk Oliver Theis, 2005, IPCO.

Fast Heuristics for Large Geometric Traveling Salesman Problems

Gerhard Reinelt, G. Reinelt, 1992, INFORMS J. Comput..

Operations Research Proceedings 2003

Gerhard Reinelt, Marcus Oswald, Dino Ahr, 2004 .

Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra

Michael Jünger, Gerhard Reinelt, Reinhardt Euler, 1987, Math. Oper. Res..

Book reviews

Gerhard Reinelt, Norbert Gaffke, M. Bischoff, 1993, ZOR Methods Model. Oper. Res..

On Travel Time Functions for Mixed Traffic Systems Dominated by Motorcycles

Gerhard Reinelt, Tuan Nam Nguyen, 2017 .

Computing finest mincut partitions of a graph and application to routing problems

Gerhard Reinelt, Dirk Oliver Theis, Klaus Michael Wenger, 2008, Discret. Appl. Math..

Reconstructing nonlinear dynamic models of gene regulation using stochastic sampling

Gerhard Reinelt, Lars Kaderali, Daniel Ritter, 2009, BMC Bioinformatics.

Selecting VITA classical shades with the VITA 3D-master shade guide.

Gerhard Reinelt, Achim Hildenbrandt, Andreas Zenthöfer, 2014, The International journal of prosthodontics.

A Branch and Cut solver for the maximum stable set problem

Gerhard Reinelt, Panos M. Pardalos, Marcus Oswald, 2011, J. Comb. Optim..

Lifting and separation procedures for the cut polytope

Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi, 2014, Math. Program..

A Polyhedral Approach to the Feedback Vertex Set Problem

Gerhard Reinelt, Meinrad Funke, G. Reinelt, 1996, IPCO.

Computing the Convex Hull in the Euclidean Plane in Linear Expected Time

Michael Jünger, Gerhard Reinelt, Karl Heinz Borgwardt, 1990, Applied Geometry And Discrete Mathematics.

New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem

Gerhard Reinelt, Dino Ahr, G. Reinelt, 2002, ESA.

PANDA: a software for polyhedral transformations

Gerhard Reinelt, Stefan Lörwald, G. Reinelt, 2015, EURO J. Comput. Optim..

On the acyclic subgraph polytope

Gerhard Reinelt, Martin Grötschel, Michael Jünger, 1985, Math. Program..

Branch-and-Cut

Gerhard Reinelt, Rafael Martí, 2011 .

A Faster Exact Separation Algorithm for Blossom Inequalities

Gerhard Reinelt, Dirk Oliver Theis, Adam N. Letchford, 2004, IPCO.

A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints

Michael Jünger, Gerhard Reinelt, Norbert Ascheuer, 2000, Comput. Optim. Appl..

Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits

Michael Jünger, Gerhard Reinelt, Alexander Martin, 1994, Math. Program..

A note on small linear-ordering polytopes

Gerhard Reinelt, G. Reinelt, 1993, Discret. Comput. Geom..

Constructing New Facets of the Consecutive Ones Polytope

Gerhard Reinelt, Marcus Oswald, 2001, Combinatorial Optimization.

Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut

Gerhard Reinelt, Thomas Christof, G. Reinelt, 2001, Algorithmica.

Chapter 8: The Capacitated Arc Routing Problem: Combinatorial Lower Bounds

Gerhard Reinelt, Dino Ahr, 2013 .

A Parallel Approach to the Pricing Step in Crew Scheduling Problems

Gerhard Reinelt, Hans Bock, T. V. Hoai, 2004 .

PathWave: discovering patterns of differentially regulated enzymes in metabolic pathways

Gerhard Reinelt, Marcus Oswald, Roland Eils, 2010, Bioinform..

Inter Programming Models for the Target Visitation Problem

Gerhard Reinelt, Achim Hildenbrandt, 2015, Informatica.

Optimal Control of Plotting and Drilling Machines

Martin Grötschel, Michael Jünger, Gerhard Reinelt, 1991 .

Solving the Earth Observing Satellite Constellation Scheduling Problem by Branch-and-Price

Gerhard Reinelt, Pei Wang, 2010, OR.

Optimal linear arrangements using betweenness variables

Gerhard Reinelt, Marcus Oswald, Alberto Caprara, 2011, Math. Program. Comput..

On the general routing polytope

Gerhard Reinelt, Dirk Oliver Theis, 2008, Discret. Appl. Math..

Facets of the linear ordering polytope

Martin Grötschel, Michael Jünger, Gerhard Reinelt, 1985, Math. Program..

A complete description of the traveling salesman polytope on 8 nodes

Michael Jünger, Gerhard Reinelt, Thomas Christof, 1991, Oper. Res. Lett..

Direct methods with maximal lower bound for mixed-integer optimal control problems

Gerhard Reinelt, Hans Georg Bock, Sebastian Sager, 2009, Math. Program..

Improved analysis of an algorithm for the coupled task problem with UET jobs

Gerhard Reinelt, Marcus Oswald, József Békési, 2009, Oper. Res. Lett..

Using discrete optimization for designing dental shade guides

Gerhard Reinelt, Marcus Oswald, Cara Cocking, 2010 .

The Traveling Salesman

Gerhard Reinelt, G. Reinelt, 2001, Lecture Notes in Computer Science.

Optimizing in Graphs with Expensive Computation of Edge Weights

Gerhard Reinelt, Marcus Oswald, Frank Noé, 2007, OR.

Kombinatorische Optimierung und VLSI-Entwurf

Gerhard Reinelt, Gerhard Reinelt, 1995 .

Lower Bound for the Online Bin Packing Problem with Restricted Repacking

Gerhard Reinelt, József Békési, János Balogh, 2008, SIAM J. Comput..

On-line bin packing with restricted repacking

Gerhard Reinelt, József Békési, János Balogh, 2014, J. Comb. Optim..

A Semi-Analytical Method for Periodic Earth Coverage Satellites Optimization

Gerhard Reinelt, Maocai Wang, Guangming Dai, 2018, IEEE Communications Letters.

Polyedrische Methoden zur Lösung großer kombinatorischer Optimierungsprobleme

Gerhard Reinelt, 1990, GI Jahrestagung.

Combinatorial optimization - Eureka, you shrink!

Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi, 2003 .

Low-Dimensional Linear Ordering Polytopes

Gerhard Reinelt, Thomas Christof, G. Reinelt, 1997 .

Parallel Computation for the Bandwidth Minimization Problem

Gerhard Reinelt, Khoa T. Vo, 2009 .

Facets of Combinatorial Optimization: Festschrift for Martin Grtschel

Gerhard Reinelt, Michael Jnger, G. Reinelt, 2013 .

Analysis of Satellite Constellations for the Continuous Coverage of Ground Regions

Gerhard Reinelt, Maocai Wang, Guangming Dai, 2017 .

Generating partitions of a graph into a fixed number of minimum weight cuts

Gerhard Reinelt, Klaus Michael Wenger, G. Reinelt, 2010, Discret. Optim..

A branch-and-bound algorithm for the coupled task problem

Gerhard Reinelt, Marcus Oswald, József Békési, 2014, Math. Methods Oper. Res..

Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization

Gerhard Reinelt, Christoph Schnörr, Jörg H. Kappes, 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

The weighted consecutive ones problem for a fixed number of rows or columns

Gerhard Reinelt, Marcus Oswald, 2003, Oper. Res. Lett..

A tutorial on branch and cut algorithms for the maximum stable set problem

Gerhard Reinelt, Panos M. Pardalos, Steffen Rebennack, 2012, Int. Trans. Oper. Res..

The Linear Ordering Problem

Gerhard Reinelt, Rafael Martí, Rafael Martí, 2011 .

Evaluating the quality of image matrices in blockmodeling

Gerhard Reinelt, Stefan Wiesberg, G. Reinelt, 2015, EURO J. Comput. Optim..

Traces of the XII Aussois Workshop on Combinatorial Optimization

Laurence A. Wolsey, Michael Jünger, Gerhard Reinelt, 2010, Math. Program..

A Convex Relaxation Approach to the Affine Subspace Clustering Problem

Gerhard Reinelt, Christoph Schnörr, Francesco Silvestri, 2015, GCPR.

Analyzing the regulation of metabolic pathways in human breast cancer

Gerhard Reinelt, Marcus Oswald, Roland Eils, 2009, BMC Medical Genomics.

Self-adaptive large neighborhood search algorithm for parallel machine scheduling problems

Gerhard Reinelt, Pei Wang, Yuejin Tan, 2012 .

A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation

Peng Gao, Gerhard Reinelt, Yuejin Tan, 2011, Comput. Ind. Eng..

Discrete Potts Model for Generating Superpixels on Noisy Images pdf

Gerhard Reinelt, Ruobing Shen, Xiaoyu Chen, 2018, ArXiv.

A Cutting Plane Algorithm for the Linear Ordering Problem

Gerhard Reinelt, Martin Grötschel, Michael Jünger, 1984, Oper. Res..

Discovering functional gene expression patterns in the metabolic network of Escherichia coli with wavelets transforms

Gerhard Reinelt, Marcus Oswald, Roland Eils, 2005, BMC Bioinformatics.

A note on the Undirected Rural Postman Problem polytope

Gerhard Reinelt, Dirk Oliver Theis, 2006, Math. Program..

Pattern recognition of gene expression data on biochemical networks with simple wavelet transforms

Gerhard Reinelt, Marcus Oswald, Roland Eils, 2006, LWA.

On partitioning the edges of graphs into connected subgraphs

Gerhard Reinelt, William R. Pulleyblank, Michael Jünger, 1985, J. Graph Theory.

A benchmark library and a comparison of heuristic methods for the linear ordering problem

Gerhard Reinelt, Abraham Duarte, Rafael Martí, 2012, Comput. Optim. Appl..

Computing correct Delaunay triangulations

Michael Jünger, Gerhard Reinelt, Doris Zepf, 2005, Computing.

Globally Optimal Image Partitioning by Multicuts

Gerhard Reinelt, Christoph Schnörr, Jörg H. Kappes, 2011, EMMCVPR.

TSPLIB - A Traveling Salesman Problem Library

Gerhard Reinelt, G. Reinelt, 1991, INFORMS J. Comput..

On the graphical relaxation of the symmetric traveling salesman polytope

Gerhard Reinelt, Marcus Oswald, Dirk Oliver Theis, 2007, Math. Program..

New results on the Windy Postman Problem

Gerhard Reinelt, Marcus Oswald, Ángel Corberán, 2012, Math. Program..

Via Minimization with Pin Preassignments and Layer Preference

Martin Grötschel, Gerhard Reinelt, M. Jönger, 1989 .

Experiments in quadratic 0–1 programming

Michael Jünger, Gerhard Reinelt, Francisco Barahona, 1989, Math. Program..

Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs pdf

Michael Jünger, Gerhard Reinelt, Franz Rendl, 2019, ArXiv.

Compression of Digital Road Networks

Gerhard Reinelt, Marcus Oswald, Sungwon Jung, 2007, SSTD.

Solving City Bus Scheduling Problems in Bangkok by Eligen-Algorithm

Gerhard Reinelt, Hans Georg Bock, Chotiros Surapholchai, 2006, HPSC.

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design

Martin Grötschel, Michael Jünger, Gerhard Reinelt, 1988, Oper. Res..

Book review

Gerhard Reinelt, G. Reinelt, 2004, Oper. Res. Lett..

Consecutive Ones and a Betweenness Problem in Computational Biology

Gerhard Reinelt, Marcus Oswald, Thomas Christof, 1998, IPCO.

A branch-and-cut approach to physical mapping with end-probes

Michael Jünger, Gerhard Reinelt, Petra Mutzel, 1997, RECOMB '97.

Priority-based and conflict-avoidance heuristics for multi-satellite scheduling

Gerhard Reinelt, Xiaoyu Chen, Guangming Dai, 2018, Appl. Soft Comput..

Locating Health Facilities in Nouna District, Burkina Faso

Gerhard Reinelt, Cara Cocking, Steffen Flessa, 2005, OR.

A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes

Michael Jünger, Gerhard Reinelt, Petra Mutzel, 1997, J. Comput. Biol..

The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization

Gerhard Reinelt, Rafael Mart, G. Reinelt, 2011 .

The travelling salesman problem

Gerhard Reinelt, Giovanni Rinaldi, M. Junguer, 1995 .

Book review

Gerhard Reinelt, 1993, ZOR Methods Model. Oper. Res..

Higher-order segmentation via multicuts

Gerhard Reinelt, Christoph Schnörr, Jörg H. Kappes, 2013, Comput. Vis. Image Underst..

Symmetry-free SDP Relaxations for Affine Subspace Clustering pdf

Gerhard Reinelt, Christoph Schnörr, Francesco Silvestri, 2016, ArXiv.

Polyhedral Aspects of the Consecutive Ones Problem

Gerhard Reinelt, Marcus Oswald, 2000, COCOON.

Practical problem solving with cutting plane algorithms in combinatorialoptimization

Michael Jünger, Gerhard Reinelt, Stefan Thienel, 1993, Combinatorial Optimization.

Computing Optimal Consecutive Ones Matrices

Gerhard Reinelt, Marcus Oswald, 2004, The Sharpest Cut.

Traveling Salesman Problem

Gerhard Reinelt, Giovanni Rinaldi, E. Malaguti, 2012 .

BoxStep methods for crew pairing problems

Gerhard Reinelt, Hans Bock, Van Hoai Tran, 2006 .

Relaxations in Practical Clustering and Blockmodeling

Gerhard Reinelt, Stefan Wiesberg, G. Reinelt, 2015, Informatica.

A Comparison of Heuristic Methods for Scheduling Earth Observing Satellites Fleet

Gerhard Reinelt, Yuejin Tan, Pei Wang, 2009, 2009 International Conference on Information Technology and Computer Science.

Network topology-based detection of differential gene regulation and regulatory switches in cell metabolism and signaling

Gerhard Reinelt, Marcus Oswald, Roland Eils, 2014, BMC Systems Biology.

A Mixed Integer Linear Programming Model for Multi-Satellite Scheduling

Andreas Spitz, Gerhard Reinelt, Xiaoyu Chen, 2018, Eur. J. Oper. Res..

Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes

Gerhard Reinelt, Thomas Christof, G. Reinelt, 2001, Int. J. Comput. Geom. Appl..

The linear ordering problem: algorithms and applications

Gerhard Reinelt, G. Reinelt, 1985 .

An exact algorithm for scheduling identical coupled tasks

Gerhard Reinelt, Marcus Oswald, Dino Ahr, 2004, Math. Methods Oper. Res..

Provably good solutions for the traveling salesman problem

Michael Jünger, Gerhard Reinelt, Stefan Thienel, 1994, Math. Methods Oper. Res..

The Lagrangian relaxation for the combinatorial integral approximation problem

Gerhard Reinelt, Sebastian Sager, Michael N. Jung, 2015, Optim. Methods Softw..

Branch-and-Bound

Gerhard Reinelt, Rafael Martí, 2011 .

Computing Best Transition Pathways in High-Dimensional Dynamical Systems: Application to the AlphaL \leftrightharpoons Beta \leftrightharpoons AlphaR Transitions in Octaalanine

Gerhard Reinelt, Marcus Oswald, Frank Noé, 2006, Multiscale Model. Simul..

Quantum Annealing versus Digital Computing

Michael Jünger, Gerhard Reinelt, Franz Rendl, 2021, ACM J. Exp. Algorithmics.

Calculating exact ground states of spin glasses: A polyhedral approach

Martin Grötschel, Michael Jünger, Gerhard Reinelt, 1987 .

A branch-and-cut algorithm with betweenness variables for the Linear Arrangement Problem

Gerhard Reinelt, 2010 .

Applying mod-k-cuts for solving linear ordering problems

Gerhard Reinelt, Marcus Oswald, Helmut K. Seitz, 2009 .

The Linear Ordering Polytope

Gerhard Reinelt, Rafael Martí, 2011 .

Improving access to health facilities in Nouna district, Burkina Faso

Gerhard Reinelt, Cara Cocking, Steffen Flessa, 2012 .

Decomposition and Parallelization Techniques for Enumerating the Facets of 0/1-Polytopes

Gerhard Reinelt, Thomas Christof, G. Reinelt, 1998 .

Combinatorial Optimization -- Eureka, You Shrink!: Papers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers

Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi, 2003 .

Minimizing the maximum travel time in a combined model of facility location and network design

Gerhard Reinelt, Iván A. Contreras, Elena Fernández, 2012 .

Calculating Exact Ground States of Spin Glasses

Martin Grötschel, Michael Jünger, Gerhard Reinelt, 1987 .

Acyclic Subdigraphs and Linear Orderings: Polytopes, Facets, and a Cutting Plane Algorithm

Martin Grötschel, Michael Jünger, Gerhard Reinelt, 1985 .

Facets of Combinatorial Optimization

Michael Jünger, Gerhard Reinelt, G. Reinelt, 2013 .

On a Multidimensional Semi-on-line Bin Packing Problem *

Gerhard Reinelt, József Békési, Gábor Galambos, 2010 .

HUHFA: A Framework for Facet Classification

Gerhard Reinelt, Ralf Borndörfer, Achim Hildenbrandt, 2013 .