World's Best Scientists 2026 revealed!
Gerhard Reinelt

Gerhard Reinelt

D-Index & Metrics

Mathematics

D-Index
44
Citations
12501
World Ranking
1542
National Ranking
90

Engineering and Technology

D-Index
45
Citations
12723
World Ranking
5339
National Ranking
169

Overview

Gerhard Reinelt is affiliated with Heidelberg University in Germany and works predominantly within the fields of Computer Science and Engineering. Their research contributions span a variety of subfields including Artificial Intelligence, Computational Theory and Mathematics, Industrial and Manufacturing Engineering, Electrical and Electronic Engineering, and Computer Vision and Pattern Recognition.

The scientist's research primarily addresses several advanced topics such as:

  • Complexity and Algorithms in Graphs
  • Machine Learning and Algorithms
  • Quantum Computing Algorithms and Architecture
  • Optimization and Packing Problems
  • Graph Theory and CDMA Systems
  • Vehicle Routing Optimization Methods
  • Algorithms and Data Compression

Gerhard Reinelt has published research articles in notable venues, with frequent publications in the ACM Journal of Experimental Algorithmics and on arXiv (Cornell University).

Their recent papers include:

  • Quantum Annealing versus Digital Computing, 2021, ACM Journal of Experimental Algorithmics
  • Comments on "An Exact Method for the Minimum Feedback Arc Set Problem", 2022, ACM Journal of Experimental Algorithmics
  • PACE Solver Description: Exact Solution of the One-sided Crossing Minimization Problem by the MPPEG Team, 2024, arXiv (Cornell University)

In addition to journal articles, Gerhard Reinelt has contributed to book publications, notably with a work titled Exact and Heuristic Methods in Combinatorial Optimization, published in 2022 by Springer Nature.

Collaboration has been an integral part of their academic activities. Frequent co-authors include Rafael Martí, Michael Jünger, Petra Mutzel, Elisabeth Lobe, and Franz Rendl.

Best Publications

  • TSPLIB—A Traveling Salesman Problem Library

    Gerhard Reinelt

  • The traveling salesman: computational solutions for TSP applications

    Gerhard Reinelt

  • An application of combinatorial optimization to statistical physics and circuit layout design

    Francisco Barahona;Martin Grötschel;Michael Jünger;Gerhard Reinelt

  • A Cutting Plane Algorithm for the Linear Ordering Problem

    Martin Grötschel;Michael Jünger;Gerhard Reinelt

  • 50 Years of Integer Programming 1958-2008

    Michael Jünger;Thomas M. Liebling;Denis Naddef;George L. Nemhauser

  • Experiments in quadratic 0-1 programming

    F. Barahona;M. Junger;G. Reinelt

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

    Rafael Mart;Gerhard Reinelt

  • The linear ordering problem: Algorithms and applications

    G. Reinelt

  • Facets of the linear ordering polytope

    Martin Grötschel;Michael Jünger;Gerhard Reinelt

  • Chapter 4 The traveling salesman problem

    Michael Jünger;Gerhard Reinelt;Giovanni Rinaldi

  • 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

  • The traveling salesman problem

    G. Reinelt;Giovanni Rinaldi

  • Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm

    C. De Simone;M. Diehl;M. Jünger;P. Mutzel

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

    Norbert Ascheuer;Michael Jünger;Gerhard Reinelt

  • On the acyclic subgraph polytope

    Martin Grötschel;Michael Jünger;Gerhard Reinelt

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

    Sebastian Sager;Hans Georg Bock;Gerhard Reinelt

  • The Linear Ordering Problem

    Rafael Martí;Gerhard Reinelt

  • A mixed integer linear programming model for multi-satellite scheduling

    Xiaoyu Chen;Xiaoyu Chen;Gerhard Reinelt;Guangming Dai;Andreas Spitz

  • Combinatorial optimization - Eureka, you shrink!

    Michael Jünger;Gerhard Reinelt;Giovanni Rinaldi

  • Computing Exact Ground States of Hard Ising Spin Glass Problems by Branch‐and‐Cut

    Frauke Liers;Michael Jünger;Gerhard Reinelt;Giovanni Rinaldi

  • Exact ground states of Ising spin glasses: new experimental results with a branch and cut algorithm

    Caterina De Simone;M. Diehl;P. Mutzel;G. Reinelt

Frequent Co-Authors

Michael Jünger
Michael Jünger University of Cologne
Roland Eils
Roland Eils Charité - University Medicine Berlin
Petra Mutzel
Petra Mutzel University of Bonn
Hans Bock
Hans Bock Goethe University Frankfurt
Christoph Schnörr
Christoph Schnörr Heidelberg University
Rafael Martí
Rafael Martí University of Valencia
Adam N. Letchford
Adam N. Letchford Lancaster University
Marc Zapatka
Marc Zapatka German Cancer Research Center
Elena Fernández
Elena Fernández Universitat Politècnica de Catalunya
Moritz Diehl
Moritz Diehl University of Freiburg

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, exploring related online degrees can open diverse career pathways. Many graduates pursue business-oriented programs to complement their analytical skills. Popular options include the one year MBA program, which offers a fast-track route to leadership roles and advanced business knowledge.

Additionally, students seeking flexibility often consider online MBA programs that accept transfer credits. These programs enable learners to tailor their education based on prior coursework, reducing time and cost while gaining valuable management skills alongside math expertise.

For those focused on data-driven careers, a data analytics masters is an excellent choice. It builds on mathematical concepts and equips students with advanced tools to analyze complex datasets, a skill highly sought after across industries.

Finally, for applicants seeking less competitive entry, exploring the easiest MBA programs could provide a practical way to earn a business degree without extensive admission barriers. These options present strategic pathways for math graduates to expand their careers beyond traditional roles.

Best Scientists Citing Gerhard Reinelt

Trending Scientists

Recently Published Articles