| Geometric algorithms and combinatorial optimization M Grötschel, L Lovász, A Schrijver Springer Science & Business Media, 2012 | 5430 | 2012 |
| The ellipsoid method and its consequences in combinatorial optimization M Grötschel, L Lovász, A Schrijver Combinatorica 1, 169-197, 1981 | 2675 | 1981 |
| 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 | 688 | 1988 |
| Polynomial algorithms for perfect graphs M Grötschel, L Lovász, A Schrijver North-Holland mathematics studies 88, 325-356, 1984 | 517 | 1984 |
| A cutting plane algorithm for the linear ordering problem M Grötschel, M Jünger, G Reinelt Operations research 32 (6), 1195-1220, 1984 | 487 | 1984 |
| Solution of large-scale symmetric travelling salesman problems M Grötschel, O Holland Mathematical Programming 51 (1), 141-202, 1991 | 470 | 1991 |
| A cutting plane algorithm for a clustering problem M Grötschel, Y Wakabayashi Mathematical Programming 45, 59-96, 1989 | 461 | 1989 |
| Polyhedral theory M Grötschel, M Padberg The traveling salesman problem. A guided tour of combinatorial optimization …, 1985 | 433 | 1985 |
| Design of survivable networks M Grötschel, CL Monma, M Stoer Handbooks in operations research and management science 7, 617-672, 1995 | 403 | 1995 |
| 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 | 382 | 2007 |
| On the symmetric travelling salesman problem I: inequalities M Grötschel, MW Padberg Mathematical Programming 16, 265-280, 1979 | 353 | 1979 |
| 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 | 319 | 2001 |
| 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 | 264 | 1992 |
| Facets of the clique partitioning polytope M Grötschel, Y Wakabayashi Mathematical Programming 47, 367-387, 1990 | 252 | 1990 |
| Facets of the linear ordering polytope M Grötschel, M Jünger, G Reinelt Mathematical programming 33, 43-60, 1985 | 250 | 1985 |
| 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 | 227 | 1990 |
| Weakly bipartite graphs and the max-cut problem M Grötschel, WR Pulleyblank Operations research letters 1 (1), 23-27, 1981 | 227 | 1981 |
| On the symmetric travelling salesman problem II: Lifting theorems and facets M Grötschel, MW Padberg Mathematical Programming 16, 281-302, 1979 | 212 | 1979 |
| Online optimization of large scale systems M Grötschel, SO Krumke, J Rambau Springer Science & Business Media, 2013 | 192 | 2013 |
| Polyhedral computations M Padberg, M Grötschel The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization …, 1985 | 182 | 1985 |
Laszlo Lovaszprofessor of mathematics, Eotvos University, Budapest在 cs.elte.hu 的电子邮件经过验证
