Follow
Martin Groetschel
Martin Groetschel
retired mathematics professor
Verified email at bbaw.de - Homepage
Title
Cited by
Cited by
Year
Geometric algorithms and combinatorial optimization
M Grötschel, L Lovász, A Schrijver
Springer Science & Business Media, 2012
53652012
The ellipsoid method and its consequences in combinatorial optimization
M Grötschel, L Lovász, A Schrijver
Combinatorica 1, 169-197, 1981
26141981
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
6501988
Polynomial algorithms for perfect graphs
M Grötschel, L Lovász, A Schrijver
North-Holland mathematics studies 88, 325-356, 1984
5001984
A cutting plane algorithm for the linear ordering problem
M Grötschel, M Jünger, G Reinelt
Operations research 32 (6), 1195-1220, 1984
4841984
Solution of large-scale symmetric travelling salesman problems
M Grötschel, O Holland
Mathematical Programming 51 (1-3), 141-202, 1991
4561991
A cutting plane algorithm for a clustering problem
M Grötschel, Y Wakabayashi
Mathematical Programming 45, 59-96, 1989
4551989
Polyhedral theory
M Grötschel, MW Padberg
The traveling salesman problem 92, 1985
4341985
Design of survivable networks
M Grötschel, CL Monma, M Stoer
Handbooks in operations research and management science 7, 617-672, 1995
4061995
A column-generation approach to line planning in public transport
R Borndörfer, M Grötschel, ME Pfetsch
Transportation Science 41 (1), 123-132, 2007
3642007
On the symmetric travelling salesman problem I: inequalities
M Grötschel, MW Padberg
Mathematical Programming 16, 265-280, 1979
3511979
Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
N Ascheuer, M Fischetti, M Grötschel
Mathematical programming 90, 475-506, 2001
3132001
Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints
M Grötschel, CL Monma, M Stoer
Operations Research 40 (2), 309-330, 1992
2651992
Facets of the clique partitioning polytope
M Grötschel, Y Wakabayashi
Mathematical Programming 47, 367-387, 1990
2511990
Facets of the linear ordering polytope
M Grötschel, M Jünger, G Reinelt
Mathematical programming 33, 43-60, 1985
2471985
Weakly bipartite graphs and the max-cut problem
M Grötschel, WR Pulleyblank
Operations research letters 1 (1), 23-27, 1981
2251981
Integer polyhedra arising from certain network design problems with connectivity constraints
M Grötschel, CL Monma
SIAM Journal on Discrete Mathematics 3 (4), 502-523, 1990
2231990
On the symmetric travelling salesman problem II: Lifting theorems and facets
M Grötschel, MW Padberg
Mathematical Programming 16, 281-302, 1979
2061979
Online optimization of large scale systems
M Grötschel, SO Krumke, J Rambau
Springer Science & Business Media, 2013
1912013
Polyhedral computations
M Padberg, M Grötschel
The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization …, 1985
1861985
The system can't perform the operation now. Try again later.
Articles 1–20