TSPLIB—A traveling salesman problem library G Reinelt ORSA journal on computing 3 (4), 376-384, 1991 | 3595 | 1991 |
The traveling salesman: computational solutions for TSP applications G Reinelt Springer, 2003 | 1615 | 2003 |
50 Years of integer programming 1958-2008: From the early years to the state-of-the-art M Jünger, TM Liebling, D Naddef, GL Nemhauser, WR Pulleyblank, ... Springer Science & Business Media, 2009 | 842* | 2009 |
The traveling salesman problem M Jünger, G Reinelt, G Rinaldi Handbooks in operations research and management science 7, 225-330, 1995 | 719 | 1995 |
An application of combinatorial optimization to statistical physics and circuit layout design F Barahona, M Grötschel, M Jünger, G Reinelt Operations Research 36 (3), 493-513, 1988 | 707 | 1988 |
A cutting plane algorithm for the linear ordering problem M Grötschel, M Jünger, G Reinelt Operations research 32 (6), 1195-1220, 1984 | 492 | 1984 |
Lecture notes in computer science M Coban, F Karakoc, M Özen, A Bogdanov SPRINGER INTERNATIONAL PUBLISHING AG, 2017 | 361* | 2017 |
The linear ordering problem: exact and heuristic methods in combinatorial optimization R Martí, G Reinelt Springer Science & Business Media, 2011 | 330 | 2011 |
Tsplib G Reinelt ftp to softlib. rice. edu, 1990 | 291 | 1990 |
Experiments in quadratic 0–1 programming F Barahona, M Jünger, G Reinelt Mathematical programming 44 (1), 127-137, 1989 | 290 | 1989 |
The linear ordering problem: algorithms and applications G Reinelt | 261 | 1985 |
Facets of the linear ordering polytope M Grötschel, M Jünger, G Reinelt Mathematical programming 33, 43-60, 1985 | 255 | 1985 |
A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation P Wang, G Reinelt, P Gao, Y Tan Computers & Industrial Engineering 61 (2), 322-335, 2011 | 235 | 2011 |
Tsplib95 G Reinelt Interdisziplinäres Zentrum für Wissenschaftliches Rechnen (IWR), Heidelberg …, 1995 | 219 | 1995 |
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, G Reinelt, G Rinaldi Journal of Statistical Physics 80, 487-496, 1995 | 216 | 1995 |
A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints N Ascheuer, M Jünger, G Reinelt Computational Optimization and Applications 17, 61-84, 2000 | 195 | 2000 |
On the acyclic subgraph polytope M Grötschel, M Jünger, G Reinelt Mathematical Programming 33, 28-42, 1985 | 168 | 1985 |
Practical problem solving with cutting plane algorithms in combinatorial optimization M Jünger, G Reinelt, S Thienel American Math. Soc 20 (20), 111-152, 1995 | 156 | 1995 |
Direct methods with maximal lower bound for mixed-integer optimal control problems S Sager, HG Bock, G Reinelt Mathematical Programming 118 (1), 109-149, 2009 | 138 | 2009 |
Optimal control of plotting and drilling machines: a case study M Grotschel, M Junger, G Reinelt Mathematical Methods of Operations Research 35 (1), 61-84, 1991 | 124 | 1991 |