Martin Grötschel - Selected Publications#

M. Grötschel, L. Lovász & A. Schrijver: Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, 1988, second edition 1993, third edition 1995.

Martin Grötschel: Future perspectives of optimization: My view, Tomomi Matsui, Mutsunori Yagiura, Koji Nonobe (Eds.): Proceedings of the Twenty-Sixth RAMP Symposium, Hosei University, Tokyo, October 16-17, 2014, 133-158.

Ralf Borndörfer, Martin Grötschel, Marc E. Pfetsch: A Column-Generation Approach to Line Planning in Public Transport, Transportation Science (INFORMS), 41:1 (2007) 123-132.

Hartwig Bosse, Martin Grötschel, Martin Henk: Polynomial inequalities representing polyhedra, Mathematical Programming, 103:1 (2005) 35-44.

Norbert Ascheuer, Matteo Fischetti, Martin Grötschel: Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut, Mathematical Programming, Series A, 90:3 (2001) 475-506.

M. Grötschel, C. Monma & M. Stoer: Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements, Operations Research, Vol. 43, No. 6 (1995), 1012-1024.

M. Grötschel, A. Martin, R. Weismantel The Steiner Tree Packing Problem in VLSI-Design. Mathematical Programming 78 (1997), 265-281.

M. Grötschel & O. Holland: Solution of Large-Scale Symmetric Travelling Salesman Problems, Mathematical Programming 51 (1991) 141-202.

M. Grötschel & K. Truemper: Decomposition and optimization over cycles in binary matroids, Journal of Combinatorial Theory (B) 46 (1989) 306-337.

M. Grötschel, F. Barahona, M. Jünger & G. Reinelt: An application of combinatorial optimization to statistical physics and circuit layout design, Operations Research 36 (1988) 493-513.

M. Grötschel & W. R. Pulleyblank: Clique tree inequalities and the symmetric travelling salesman problem, Mathematics of Operations Research 11 (1986) 537-569.

M. Grötschel, M. Jünger & G. Reinelt: Facets of the linear ordering polytope, Mathematical Programming 33 (1985) 43-60.

M. Grötschel, L. Lovász & A. Schrijver: The ellipsoid method and its consequences in combinatorial optimization,
Combinatorica 1 (1981) 169-197.

According to Google Scholar (per 13 April 2017):
14854 quotations; 3799 since 2012
h-index: 47