| 2008 |
| 26 | EE | Martin Grötschel,
George L. Nemhauser:
George Dantzig's contributions to integer programming.
Discrete Optimization 5(2): 168-173 (2008) |
| 2005 |
| 25 | EE | Hartwig Bosse,
Martin Grötschel,
Martin Henk:
Polynomial inequalities representing polyhedra.
Math. Program. 103(1): 35-44 (2005) |
| 2003 |
| 24 | EE | Martin Grötschel,
Martin Henk:
The Representation of Polyhedra by Polynomial Inequalities.
Discrete & Computational Geometry 29(4): 485-504 (2003) |
| 2001 |
| 23 | | Martin Grötschel:
Cooperative Scientific Digital Libraries.
IuK 2001 |
| 22 | EE | Gabriele Beger,
Peter Diepold,
Martin Grötschel,
Maximilian Herberger,
Stephan Ory,
Roland Schwänzl:
Panel: Legal Aspects of Information Systems.
IuK 2001 |
| 2000 |
| 21 | EE | Martin Grötschel:
Frequency Assignment in Mobile Phone Systems.
FSTTCS 2000: 81-86 |
| 20 | EE | Norbert Ascheuer,
Matteo Fischetti,
Martin Grötschel:
A polyhedral study of the asymmetric traveling salesman problem with time windows.
Networks 36(2): 69-79 (2000) |
| 1997 |
| 19 | | Martin Grötschel,
Alexander Martin,
Robert Weismantel:
The Steiner tree packing problem in VLSI design.
Math. Program. 77: 265-281 (1997) |
| 1996 |
| 18 | EE | Martin Grötschel,
Alexander Martin,
Robert Weismantel:
Packing Steiner Trees: Further Facets.
Eur. J. Comb. 17(1): 39-52 (1996) |
| 17 | | Martin Grötschel,
Alexander Martin,
Robert Weismantel:
Packing Steiner trees: polyhedral investigations.
Math. Program. 72: 101-123 (1996) |
| 16 | | Martin Grötschel,
Alexander Martin,
Robert Weismantel:
Packing Steiner trees: a cutting plane algorithm and computational results.
Math. Program. 72: 125-145 (1996) |
| 15 | EE | Martin Grötschel,
Alexander Martin,
Robert Weismantel:
Packing Steiner Trees: Separation Algorithms.
SIAM J. Discrete Math. 9(2): 233-257 (1996) |
| 1995 |
| 14 | | Martin Grötschel,
Joachim Lügger:
Neue Produkte - die Funktionen der Beteiligten.
Die unendliche Bibliothek 1995: 38-67 |
| 1993 |
| 13 | | Martin Grötschel,
Alexander Martin,
Robert Weismantel:
Routing in grid graphs by cutting planes.
IPCO 1993: 447-461 |
| 1992 |
| 12 | EE | Martin Grötschel:
Theoretical and Practical Aspects of Combinatorial Problem Solving.
SODA 1992: 195 |
| 11 | | Martin Grötschel,
Zaw Win:
A cutting plane algorithm for the windy postman problem.
Math. Program. 55: 339-358 (1992) |
| 1991 |
| 10 | | Martin Grötschel,
Olaf Holland:
Solution of large-scale symmetric travelling salesman problems.
Math. Program. 51: 141-202 (1991) |
| 1990 |
| 9 | | Norbert Ascheuer,
Laureano F. Escudero,
Martin Grötschel,
Mechthild Stoer:
On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem.
IPCO 1990: 19-28 |
| 8 | | Martin Grötschel,
Yoshiko Wakabayashi:
Facets of the Clique Partitioning Polytope.
Math. Program. 47: 367-387 (1990) |
| 7 | | Martin Grötschel,
Clyde L. Monma:
Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints.
SIAM J. Discrete Math. 3(4): 502-523 (1990) |
| 1989 |
| 6 | EE | Martin Grötschel,
Klaus Truemper:
Decomposition and optimization over cycles in binary matroids.
J. Comb. Theory, Ser. B 46(3): 306-337 (1989) |
| 1986 |
| 5 | EE | Francisco Barahona,
Martin Grötschel:
On the cycle polytope of a binary matroid.
J. Comb. Theory, Ser. B 40(1): 40-62 (1986) |
| 4 | EE | Martin Grötschel,
László Lovász,
Alexander Schrijver:
Relaxations of vertex packing.
J. Comb. Theory, Ser. B 40(3): 330-343 (1986) |
| 1984 |
| 3 | | Martin Grötschel,
László Lovász,
Alexander Schrijver:
Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization".
Combinatorica 4(4): 291-295 (1984) |
| 1981 |
| 2 | | Martin Grötschel,
László Lovász,
Alexander Schrijver:
The ellipsoid method and its consequences in combinatorial optimization.
Combinatorica 1(2): 169-197 (1981) |
| 1 | EE | Martin Grötschel,
Yoshiko Wakabayashi:
On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets.
Discrete Mathematics 34(1): 43-59 (1981) |