Martin Grötschel

According to our database1, Martin Grötschel authored at least 73 papers between 1975 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



APE 2018: Academic Publishing in Europe, Introduction.
Inf. Serv. Use, 2018

Mathematical Berlin - Science, Sights and Stories.
Berlin Story Verlag, ISBN: 978-3-9572308-0-5, 2016

Towards optimizing the deployment of optical access networks.
EURO J. Comput. Optim., 2014

Characterization of facets of the hop constrained chain polytope via dynamic programming.
Discret. Appl. Math., 2014

Mathematical methods for physical layout of printed circuit boards: an overview.
OR Spectr., 2008

George Dantzig's contributions to integer programming.
Discret. Optim., 2008

A Column-Generation Approach to Line Planning in Public Transport.
Transp. Sci., 2007

Polynomial inequalities representing polyhedra.
Math. Program., 2005

Cardinality Homogeneous Set Systems, Cycles in Matroids, and Associated Polytopes.
Proceedings of the Sharpest Cut, 2004

The Representation of Polyhedra by Polynomial Inequalities.
Discret. Comput. Geom., 2003

Frequency planning and ramifications of coloring.
Discuss. Math. Graph Theory, 2002

Online-Dispatching of Automobile Service Units.
Proceedings of the Operations Research Proceedings 2002, 2002

Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut.
Math. Program., 2001

Cooperative Scientific Digital Libraries.
Proceedings of the 7th Annual Meeting of the IuK Initiative Information and Communication of the Learned Societies in Germany, 2001

Panel: Legal Aspects of Information Systems.
Proceedings of the 7th Annual Meeting of the IuK Initiative Information and Communication of the Learned Societies in Germany, 2001

A polyhedral study of the asymmetric traveling salesman problem with time windows.
Networks, 2000

Frequency Assignment in Mobile Phone Systems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

Order picking in an automatic warehouse: Solving online asymmetric TSPs.
Math. Methods Oper. Res., 1999

Frequency assignment in cellular phone networks.
Ann. Oper. Res., 1998

Cost-efficient network synthesis from leased lines.
Ann. Oper. Res., 1998

Design of broadband virtual private networks: Model and heuristics for the B-WiN.
Proceedings of the Robust Communication Networks: Interconnection and Survivability, 1998

The Steiner tree packing problem in VLSI design.
Math. Program., 1997

Packing Steiner Trees: Separation Algorithms.
SIAM J. Discret. Math., 1996

Packing Steiner trees: a cutting plane algorithm and computational results.
Math. Program., 1996

Packing Steiner trees: polyhedral investigations.
Math. Program., 1996

Packing Steiner Trees: Further Facets.
Eur. J. Comb., 1996

Routing in grid graphs by cutting planes.
Math. Methods Oper. Res., 1995

Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements.
Oper. Res., 1995

Neue Produkte - die Funktionen der Beteiligten.
Proceedings of the Die unendliche Bibliothek, 1995

A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing).
SIAM J. Optim., 1993

Some integer programs arising in the design of main frame computers.
ZOR Methods Model. Oper. Res., 1993

Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints.
SIAM J. Optim., 1992

A cutting plane algorithm for the windy postman problem.
Math. Program., 1992

Clique-Web Facets for Multicut Polytopes.
Math. Oper. Res., 1992

Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints.
Oper. Res., 1992

Theoretical and Practical Aspects of Combinatorial Problem Solving.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Solution of large-scale symmetric travelling salesman problems.
Math. Program., 1991

Optimal control of plotting and drilling machines: A case study.
ZOR Methods Model. Oper. Res., 1991

Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints.
SIAM J. Discret. Math., 1990

Facets of the Clique Partitioning Polytope.
Math. Program., 1990

On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

Complete Descriptions of Small Multicut Polytopes.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

A cutting plane algorithm for a clustering problem.
Math. Program., 1989

Decomposition and optimization over cycles in binary matroids.
J. Comb. Theory, Ser. B, 1989

Polyhedral Approaches to Network Survivability.
Proceedings of the Reliability Of Computer And Communication Networks, 1989

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design.
Oper. Res., 1988

Geometric Algorithms and Combinatorial Optimization
Algorithms and Combinatorics 2, Springer, ISBN: 978-3-642-97881-4, 1988

Corrigenda: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem.
Math. Oper. Res., 1987

A cutting plane algorithm for minimum perfect 2-matchings.
Computing, 1987

Clique Tree Inequalities and the Symmetric Travelling Salesman Problem.
Math. Oper. Res., 1986

Relaxations of vertex packing.
J. Comb. Theory, Ser. B, 1986

On the cycle polytope of a binary matroid.
J. Comb. Theory, Ser. B, 1986

Facets of the linear ordering polytope.
Math. Program., 1985

On the acyclic subgraph polytope.
Math. Program., 1985

Solving matching problems with linear programming.
Math. Program., 1985

Facets of the Bipartite Subgraph Polytope.
Math. Oper. Res., 1985

A polynomial algorithm for the max-cut problem on graphs without long odd cycles.
Math. Program., 1984

A Cutting Plane Algorithm for the Linear Ordering Problem.
Oper. Res., 1984

Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization".
Comb., 1984

Scientific Program.
Proceedings of the Mathematical Programming The State of the Art, 1982

Weakly bipartite graphs and the Max-cut problem.
Oper. Res. Lett., 1981

On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets.
Discret. Math., 1981

The ellipsoid method and its consequences in combinatorial optimization.
Comb., 1981

On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets.
Math. Oper. Res., 1980

Hypotraceable digraphs.
J. Graph Theory, 1980

On the symmetric travelling salesman problem II: Lifting theorems and facets.
Math. Program., 1979

On the symmetric travelling salesman problem I: Inequalities.
Math. Program., 1979

Z. Oper. Research, 1979

The graphs for which all strong orientations are hamiltonian.
J. Graph Theory, 1979

On minimal strong blocks.
J. Graph Theory, 1979

A property of continuous unbounded algorithms.
Math. Program., 1978

Lineare Charakterisierungen von Travelling Salesman Problemen.
Math. Methods Oper. Res., 1977

Partial linear characterizations of the asymmetric travelling salesman polytope.
Math. Program., 1975