Partial linear characterizations of the asymmetric travelling salesman polytope. - Martin Grötschel; Manfred W. Padberg (Math. Program., 1975)

Lineare Charakterisierungen von Travelling Salesman Problemen. - Martin Grötschel; Manfred W. Padberg (Math. Methods Oper. Res., 1977)

A property of continuous unbounded algorithms. - Martin Grötschel; Rabe von Randow (Math. Program., 1978)

On minimal strong blocks. - Martin Grötschel (J. Graph Theory, 1979)

The graphs for which all strong orientations are hamiltonian. - Martin Grötschel; Frank Harary (J. Graph Theory, 1979)

Buchbesprechungen. - J. Wilhelm; Martin Grötschel; E. Mezgolits; Ernst Strohmeier; Ernst Unsin; Klaus Brockhoff; Dietrich Ohse (Z. Oper. Research, 1979)

On the symmetric travelling salesman problem I: Inequalities. - Martin Grötschel; Manfred Padberg (Math. Program., 1979)

On the symmetric travelling salesman problem II: Lifting theorems and facets. - Martin Grötschel; Manfred Padberg (Math. Program., 1979)

Hypotraceable digraphs. - Martin Grötschel; Carsten Thomassen; Yoshiko Wakabayashi (J. Graph Theory, 1980)

On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets. - Martin Grötschel (Math. Oper. Res., 1980)

The ellipsoid method and its consequences in combinatorial optimization. - Martin Grötschel; László Lovász 001; Alexander Schrijver (Comb., 1981)

On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. - Martin Grötschel; Yoshiko Wakabayashi (Discret. Math., 1981)

Weakly bipartite graphs and the Max-cut problem. - Martin Grötschel; William R. Pulleyblank (Oper. Res. Lett., 1981)

Scientific Program. - Achim Bachem; Bernhard Korte; Martin Grötschel (ISMP, 1982)

Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization". - Martin Grötschel; László Lovász 001; Alexander Schrijver (Comb., 1984)

A Cutting Plane Algorithm for the Linear Ordering Problem. - Martin Grötschel; Michael Jünger; Gerhard Reinelt (Oper. Res., 1984)

A polynomial algorithm for the max-cut problem on graphs without long odd cycles. - Martin Grötschel; George L. Nemhauser (Math. Program., 1984)

Facets of the Bipartite Subgraph Polytope. - Francisco Barahona; Martin Grötschel; Ali Ridha Mahjoub (Math. Oper. Res., 1985)

Solving matching problems with linear programming. - Martin Grötschel; Olaf Holland (Math. Program., 1985)

On the acyclic subgraph polytope. - Martin Grötschel; Michael Jünger; Gerhard Reinelt (Math. Program., 1985)

Facets of the linear ordering polytope. - Martin Grötschel; Michael Jünger; Gerhard Reinelt (Math. Program., 1985)

On the cycle polytope of a binary matroid. - Francisco Barahona; Martin Grötschel (J. Comb. Theory B, 1986)

Relaxations of vertex packing. - Martin Grötschel; László Lovász 001; Alexander Schrijver (J. Comb. Theory B, 1986)

Clique Tree Inequalities and the Symmetric Travelling Salesman Problem. - Martin Grötschel; William R. Pulleyblank (Math. Oper. Res., 1986)

A cutting plane algorithm for minimum perfect 2-matchings. - Martin Grötschel; Olaf Holland (Computing, 1987)

Corrigenda: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem. - Martin Grötschel; William R. Pulleyblank (Math. Oper. Res., 1987)

Geometric Algorithms and Combinatorial Optimization - Martin Grötschel; László Lovász 001; Alexander Schrijver (Springer, 1988)

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design. - Francisco Barahona; Martin Grötschel; Michael Jünger; Gerhard Reinelt (Oper. Res., 1988)

Polyhedral Approaches to Network Survivability. - Martin Grötschel; Clyde L. Monma; Mechthild Stoer (Reliability Of Computer And Communication Networks, 1989)

Decomposition and optimization over cycles in binary matroids. - Martin Grötschel; Klaus Truemper (J. Comb. Theory B, 1989)

A cutting plane algorithm for a clustering problem. - Martin Grötschel; Yoshiko Wakabayashi (Math. Program., 1989)

Complete Descriptions of Small Multicut Polytopes. - Michel Deza; Martin Grötschel; Monique Laurent (Applied Geometry And Discrete Mathematics, 1990)

On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem. - Norbert Ascheuer; Laureano F. Escudero; Martin Grötschel; Mechthild Stoer (IPCO, 1990)

Facets of the Clique Partitioning Polytope. - Martin Grötschel; Yoshiko Wakabayashi (Math. Program., 1990)

Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints. - Martin Grötschel; Clyde L. Monma (SIAM J. Discret. Math., 1990)

Optimal control of plotting and drilling machines: A case study. - Martin Grötschel; Michael Jünger; Gerhard Reinelt (ZOR Methods Model. Oper. Res., 1991)

Solution of large-scale symmetric travelling salesman problems. - Martin Grötschel; Olaf Holland (Math. Program., 1991)

Theoretical and Practical Aspects of Combinatorial Problem Solving. - Martin Grötschel (SODA, 1992)

Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints. - Martin Grötschel; Clyde L. Monma; Mechthild Stoer (Oper. Res., 1992)

Clique-Web Facets for Multicut Polytopes. - Michel Deza; Martin Grötschel; Monique Laurent (Math. Oper. Res., 1992)

A cutting plane algorithm for the windy postman problem. - Martin Grötschel; Zaw Win (Math. Program., 1992)

Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints. - Martin Grötschel; Clyde L. Monma; Mechthild Stoer (SIAM J. Optim., 1992)

Some integer programs arising in the design of main frame computers. - Carlos E. Ferreira; Martin Grötschel; Alexander Martin 001; Robert Weismantel; Stefan Kiefl; Ludwig Krispenz (ZOR Methods Model. Oper. Res., 1993)

A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing). - Norbert Ascheuer; Laureano F. Escudero; Martin Grötschel; Mechthild Stoer (SIAM J. Optim., 1993)

Neue Produkte - die Funktionen der Beteiligten. - Martin Grötschel; Joachim Lügger (Die unendliche Bibliothek, 1995)

Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements. - Martin Grötschel; Clyde L. Monma; Mechthild Stoer (Oper. Res., 1995)

Routing in grid graphs by cutting planes. - Martin Grötschel; Alexander Martin 001; Robert Weismantel (Math. Methods Oper. Res., 1995)

Packing Steiner Trees: Further Facets. - Martin Grötschel; Alexander Martin 001; Robert Weismantel (Eur. J. Comb., 1996)

Packing Steiner trees: polyhedral investigations. - Martin Grötschel; Alexander Martin 001; Robert Weismantel (Math. Program., 1996)

Packing Steiner trees: a cutting plane algorithm and computational results. - Martin Grötschel; Alexander Martin 001; Robert Weismantel (Math. Program., 1996)

Packing Steiner Trees: Separation Algorithms. - Martin Grötschel; Alexander Martin 001; Robert Weismantel (SIAM J. Discret. Math., 1996)

The Steiner tree packing problem in VLSI design. - Martin Grötschel; Alexander Martin 001; Robert Weismantel (Math. Program., 1997)

Design of broadband virtual private networks: Model and heuristics for the B-WiN. - Andreas Bley; Martin Grötschel; Roland Wessäly (Robust Communication Networks: Interconnection and Survivability, 1998)

Cost-efficient network synthesis from leased lines. - Dimitris Alevras; Martin Grötschel; Roland Wessäly (Ann. Oper. Res., 1998)

Frequency assignment in cellular phone networks. - Ralf Borndörfer; Andreas Eisenblätter; Martin Grötschel; Alexander Martin 001 (Ann. Oper. Res., 1998)

Survivable mobile phone network architectures: models and solution methods. - Dimitris Alevras; Martin Grötschel; Peter Jonas; Ulrich Paul; Roland Wessäly (IEEE Commun. Mag., 1998)

Order picking in an automatic warehouse: Solving online asymmetric TSPs. - Norbert Ascheuer; Martin Grötschel; Atef Abdel-Aziz Abdel-Hamid (Math. Methods Oper. Res., 1999)

Frequency Assignment in Mobile Phone Systems. - Martin Grötschel (FSTTCS, 2000)

A polyhedral study of the asymmetric traveling salesman problem with time windows. - Norbert Ascheuer; Matteo Fischetti; Martin Grötschel (Networks, 2000)

Panel: Legal Aspects of Information Systems. - Gabriele Beger; Peter Diepold; Martin Grötschel; Maximilian Herberger; Stephan Ory; Roland Schwänzl (IuK, 2001)

Cooperative Scientific Digital Libraries. - Martin Grötschel (IuK, 2001)

Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut. - Norbert Ascheuer; Matteo Fischetti; Martin Grötschel (Math. Program., 2001)

Online-Dispatching of Automobile Service Units. - Martin Grötschel; Sven Oliver Krumke; Jörg Rambau; Luis Miguel Torres (OR, 2002)

Frequency planning and ramifications of coloring. - Andreas Eisenblätter; Martin Grötschel; Arie M. C. A. Koster (Discuss. Math. Graph Theory, 2002)

The Representation of Polyhedra by Polynomial Inequalities. - Martin Grötschel; Martin Henk (Discret. Comput. Geom., 2003)

Cardinality Homogeneous Set Systems, Cycles in Matroids, and Associated Polytopes. - Martin Grötschel (The Sharpest Cut, 2004)

Polynomial inequalities representing polyhedra. - Hartwig Bosse; Martin Grötschel; Martin Henk (Math. Program., 2005)

A Column-Generation Approach to Line Planning in Public Transport. - Ralf Borndörfer; Martin Grötschel; Marc E. Pfetsch (Transp. Sci., 2007)

George Dantzig's contributions to integer programming. - Martin Grötschel; George L. Nemhauser (Discret. Optim., 2008)

Mathematical methods for physical layout of printed circuit boards: an overview. - Nadine Abboud; Martin Grötschel; Thorsten Koch (OR Spectr., 2008)

Characterization of facets of the hop constrained chain polytope via dynamic programming. - Martin Grötschel; Rüdiger Stephan (Discret. Appl. Math., 2014)

Towards optimizing the deployment of optical access networks. - Martin Grötschel; Christian Raack; Axel Werner (EURO J. Comput. Optim., 2014)

Mathematical Berlin - Science, Sights and Stories. - Iris Grötschel; Martin Grötschel (Berlin Story Verlag, 2016)

APE 2018: Academic Publishing in Europe, Introduction. - Martin Grötschel (Inf. Serv. Use, 2018)

Comments on "An Exact Method for the Minimum Feedback Arc Set Problem". - Martin Grötschel; Michael Jünger; Gerhard Reinelt (ACM J. Exp. Algorithmics, 2022)

The Mathematics of László Lovász. - Martin Grötschel; Jaroslav Nesetril (CoRR, 2023)