Gerhard Reinelt

According to our database1, Gerhard Reinelt authored at least 94 papers between 1984 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 





A mixed integer linear programming model for multi-satellite scheduling.
Eur. J. Oper. Res., 2019

Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs.
CoRR, 2019

A Semi-Analytical Method for Periodic Earth Coverage Satellites Optimization.
IEEE Commun. Lett., 2018

Discrete Potts Model for Generating Superpixels on Noisy Images.
CoRR, 2018

Priority-based and conflict-avoidance heuristics for multi-satellite scheduling.
Appl. Soft Comput., 2018

An ILP Solver for Multi-label MRFS with Connectivity Constraints.
CoRR, 2017

A First Derivative Potts Model for Segmentation and Denoising Using MILP.
CoRR, 2017

A First Derivative Potts Model for Segmentation and Denoising Using ILP.
Proceedings of the Operations Research Proceedings 2017, 2017

Higher-order segmentation via multicuts.
Comput. Vis. Image Underst., 2016

Symmetry-free SDP Relaxations for Affine Subspace Clustering.
CoRR, 2016

The Lagrangian relaxation for the combinatorial integral approximation problem.
Optim. Methods Softw., 2015

Relaxations in Practical Clustering and Blockmodeling.
Informatica (Slovenia), 2015

Inter Programming Models for the Target Visitation Problem.
Informatica (Slovenia), 2015

Evaluating the quality of image matrices in blockmodeling.
EURO J. Comput. Optim., 2015

PANDA: a software for polyhedral transformations.
EURO J. Comput. Optim., 2015

A Convex Relaxation Approach to the Affine Subspace Clustering Problem.
Proceedings of the Pattern Recognition - 37th German Conference, 2015

Lifting and separation procedures for the cut polytope.
Math. Program., 2014

A branch-and-bound algorithm for the coupled task problem.
Math. Methods Oper. Res., 2014

On-line bin packing with restricted repacking.
J. Comb. Optim., 2014

Network topology-based detection of differential gene regulation and regulatory switches in cell metabolism and signaling.
BMC Syst. Biol., 2014

A Flow Formulation for the Optimum Communication Spanning Tree.
Electron. Notes Discret. Math., 2013

Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization.
Proceedings of the 2013 IEEE Conference on Computer Vision and Pattern Recognition, 2013

New results on the Windy Postman Problem.
Math. Program., 2012

A tutorial on branch and cut algorithms for the maximum stable set problem.
Int. Trans. Oper. Res., 2012

Exact solution of the 2-dimensional grid arrangement problem.
Discret. Optim., 2012

A benchmark library and a comparison of heuristic methods for the linear ordering problem.
Comput. Optim. Appl., 2012

Optimal linear arrangements using betweenness variables.
Math. Program. Comput., 2011

A Branch and Cut solver for the maximum stable set problem.
J. Comb. Optim., 2011

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

Globally Optimal Image Partitioning by Multicuts.
Proceedings of the Energy Minimazation Methods in Computer Vision and Pattern Recognition, 2011

Traces of the XII Aussois Workshop on Combinatorial Optimization.
Math. Program., 2010

A Heuristic for an Earth Observing Satellite Constellation Scheduling Problem with Download Considerations.
Electron. Notes Discret. Math., 2010

Generating partitions of a graph into a fixed number of minimum weight cuts.
Discret. Optim., 2010

PathWave: discovering patterns of differentially regulated enzymes in metabolic pathways.
Bioinform., 2010

Solving the Earth Observing Satellite Constellation Scheduling Problem by Branch-and-Price.
Proceedings of the Operations Research Proceedings 2010, 2010

The simultaneous consecutive ones problem.
Theor. Comput. Sci., 2009

Improved analysis of an algorithm for the coupled task problem with UET jobs.
Oper. Res. Lett., 2009

Direct methods with maximal lower bound for mixed-integer optimal control problems.
Math. Program., 2009

Reconstructing nonlinear dynamic models of gene regulation using stochastic sampling.
BMC Bioinform., 2009

Analyzing the regulation of metabolic pathways in human breast cancer.
Proceedings of the LWA 2009: Workshop-Woche: Lernen, 2009

Odd Minimum Cut Sets and b-Matchings Revisited.
SIAM J. Discret. Math., 2008

Lower Bound for the Online Bin Packing Problem with Restricted Repacking.
SIAM J. Comput., 2008

Computing finest mincut partitions of a graph and application to routing problems.
Discret. Appl. Math., 2008

On the general routing polytope.
Discret. Appl. Math., 2008

On the graphical relaxation of the symmetric traveling salesman polytope.
Math. Program., 2007

Compression of Digital Road Networks.
Proceedings of the Advances in Spatial and Temporal Databases, 2007

Optimizing in Graphs with Expensive Computation of Edge Weights.
Proceedings of the Operations Research, 2007

A note on the Undirected Rural Postman Problem polytope.
Math. Program., 2006

Computing Best Transition Pathways in High-Dimensional Dynamical Systems: Application to the <i>Alpha<sub>L</sub></i> \leftrightharpoons <i>Beta</i> \leftrightharpoons <i>Alpha<sub>R</sub></i> Transitions in Octaalanine.
Multiscale Model. Simul., 2006

Maximally Violated Mod-<i>p</i> Cuts for the Capacitated Vehicle-Routing Problem.
INFORMS J. Comput., 2006

A tabu search algorithm for the min-max <i>k</i>-Chinese postman problem.
Comput. Oper. Res., 2006

Discovering functional gene expression patterns in the metabolic network of <i>Escherichia coli </i>with wavelets transforms.
BMC Bioinform., 2006

Pattern recognition of gene expression data on biochemical networks with simple wavelet transforms.
Proceedings of the LWA 2006: Lernen - Wissensentdeckung - Adaptivität, Hildesheim, Deutschland, October 9th-11th 2006, joint workshop event of several interest groups of the German Society for Informatics (GI) - 14th Workshop on Adaptivity and User Modeling in Interactive Systems (ABIS 2006) - Workshop Information Retrieval 2006 of the Special Interest Group Information Retrieval (FGIR 2006) - Workshop on Knowledge and Experience Management (FGWM 2006), 2006

Solving City Bus Scheduling Problems in Bangkok by Eligen-Algorithm.
Proceedings of the Modeling, 2006

Transformation of Facets of the General Routing Problem Polytope.
SIAM J. Optim., 2005

Locating Health Facilities in Nouna District, Burkina Faso.
Proceedings of the Operations Research Proceedings 2005, 2005

Not Every GTSP Facet Induces an STSP Facet.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

Book review.
Oper. Res. Lett., 2004

An exact algorithm for scheduling identical coupled tasks.
Math. Methods Oper. Res., 2004

A Faster Exact Separation Algorithm for Blossom Inequalities.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

Computing Optimal Consecutive Ones Matrices.
Proceedings of the Sharpest Cut, 2004

The weighted consecutive ones problem for a fixed number of rows or columns.
Oper. Res. Lett., 2003

Advanced Column Generation Techniques for Crew Pairing Problems.
Proceedings of the Modeling, 2003

New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem.
Proceedings of the Algorithms, 2002

Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes.
Int. J. Comput. Geom. Appl., 2001

Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut.
Algorithmica, 2001

Constructing New Facets of the Consecutive Ones Polytope.
Proceedings of the Combinatorial Optimization, 2001

A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints.
Comput. Optim. Appl., 2000

Polyhedral Aspects of the Consecutive Ones Problem.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

Consecutive Ones and a Betweenness Problem in Computational Biology.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes.
J. Comput. Biol., 1997

A branch-and-cut approach to physical mapping with end-probes.
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

A Polyhedral Approach to the Feedback Vertex Set Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits.
Math. Program., 1994

Provably good solutions for the traveling salesman problem.
Math. Methods Oper. Res., 1994

The Traveling Salesman, Computational Solutions for TSP Applications
Lecture Notes in Computer Science 840, Springer, ISBN: 3-540-58334-3, 1994

Book reviews.
ZOR Methods Model. Oper. Res., 1993

A Note on Small Linear-Ordering Polytopes.
Discret. Comput. Geom., 1993

Practical problem solving with cutting plane algorithms in combinatorialoptimization.
Proceedings of the Combinatorial Optimization, 1993

Fast Heuristics for Large Geometric Traveling Salesman Problems.
INFORMS J. Comput., 1992

A complete description of the traveling salesman polytope on 8 nodes.
Oper. Res. Lett., 1991

Optimal control of plotting and drilling machines: A case study.
ZOR Methods Model. Oper. Res., 1991

TSPLIB - A Traveling Salesman Problem Library.
INFORMS J. Comput., 1991

Computing correct Delaunay triangulations.
Computing, 1991

Polyedrische Methoden zur Lösung großer kombinatorischer Optimierungsprobleme.
Proceedings of the GI, 1990

Computing the Convex Hull in the Euclidean Plane in Linear Expected Time.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

Experiments in quadratic 0-1 programming.
Math. Program., 1989

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design.
Oper. Res., 1988

Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra.
Math. Oper. Res., 1987

The linear ordering problem: algorithms and applications.
PhD thesis, 1985

Facets of the linear ordering polytope.
Math. Program., 1985

On the acyclic subgraph polytope.
Math. Program., 1985

On partitioning the edges of graphs into connected subgraphs.
J. Graph Theory, 1985

A Cutting Plane Algorithm for the Linear Ordering Problem.
Oper. Res., 1984