Martin Grötschel

Publication Activity (10 Years)

Years Active: 1975-2023
Publications (10 Years): 3

Top Topics

Atmospheric Turbulence

Automatic Programming

Covering A Wide Range

Top Venues

ACM J. Exp. Algorithmics

Discret. Appl. Math.

Publications

Martin Grötschel, Jaroslav Nesetril
The Mathematics of László Lovász. CoRR (2023)
Martin Grötschel, Michael Jünger, Gerhard Reinelt
Comments on "An Exact Method for the Minimum Feedback Arc Set Problem". ACM J. Exp. Algorithmics 27 (2022)
Martin Grötschel
APE 2018: Academic Publishing in Europe, Introduction. Inf. Serv. Use 38 (4) (2018)
Martin Grötschel, Rüdiger Stephan
Characterization of facets of the hop constrained chain polytope via dynamic programming. Discret. Appl. Math. 162 (2014)
Martin Grötschel, Christian Raack, Axel Werner
Towards optimizing the deployment of optical access networks. EURO J. Comput. Optim. 2 (1-2) (2014)
Martin Grötschel, George L. Nemhauser
George Dantzig's contributions to integer programming. Discret. Optim. 5 (2) (2008)
Nadine Abboud, Martin Grötschel, Thorsten Koch
Mathematical methods for physical layout of printed circuit boards: an overview. OR Spectr. 30 (3) (2008)
Ralf Borndörfer, Martin Grötschel, Marc E. Pfetsch
A Column-Generation Approach to Line Planning in Public Transport. Transp. Sci. 41 (1) (2007)
Hartwig Bosse, Martin Grötschel, Martin Henk
Polynomial inequalities representing polyhedra. Math. Program. 103 (1) (2005)
Martin Grötschel, Martin Henk
The Representation of Polyhedra by Polynomial Inequalities. Discret. Comput. Geom. 29 (4) (2003)
Andreas Eisenblätter, Martin Grötschel, Arie M. C. A. Koster
Frequency planning and ramifications of coloring. Discuss. Math. Graph Theory 22 (1) (2002)
Martin Grötschel, Sven Oliver Krumke, Jörg Rambau, Luis Miguel Torres
Online-Dispatching of Automobile Service Units. OR (2002)
Martin Grötschel
Cooperative Scientific Digital Libraries. IuK (2001)
Gabriele Beger, Peter Diepold, Martin Grötschel, Maximilian Herberger, Stephan Ory, Roland Schwänzl
Panel: Legal Aspects of Information Systems. IuK (2001)
Norbert Ascheuer, Matteo Fischetti, Martin Grötschel
Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut. Math. Program. 90 (3) (2001)
Norbert Ascheuer, Matteo Fischetti, Martin Grötschel
A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36 (2) (2000)
Martin Grötschel
Frequency Assignment in Mobile Phone Systems. FSTTCS (2000)
Norbert Ascheuer, Martin Grötschel, Atef Abdel-Aziz Abdel-Hamid
Order picking in an automatic warehouse: Solving online asymmetric TSPs. Math. Methods Oper. Res. 49 (3) (1999)
Ralf Borndörfer, Andreas Eisenblätter, Martin Grötschel, Alexander Martin
Frequency assignment in cellular phone networks. Ann. Oper. Res. 76 (1998)
Dimitris Alevras, Martin Grötschel, Roland Wessäly
Cost-efficient network synthesis from leased lines. Ann. Oper. Res. 76 (1998)
Dimitris Alevras, Martin Grötschel, Peter Jonas, Ulrich Paul, Roland Wessäly
Survivable mobile phone network architectures: models and solution methods. IEEE Commun. Mag. 36 (3) (1998)
Andreas Bley, Martin Grötschel, Roland Wessäly
Design of broadband virtual private networks: Model and heuristics for the B-WiN. Robust Communication Networks: Interconnection and Survivability (1998)
Martin Grötschel, Alexander Martin, Robert Weismantel
The Steiner tree packing problem in VLSI design. Math. Program. 77 (1997)
Martin Grötschel, Alexander Martin, Robert Weismantel
Packing Steiner Trees: Further Facets. Eur. J. Comb. 17 (1) (1996)
Martin Grötschel, Alexander Martin, Robert Weismantel
Packing Steiner trees: a cutting plane algorithm and computational results. Math. Program. 72 (1996)
Martin Grötschel, Alexander Martin, Robert Weismantel
Packing Steiner Trees: Separation Algorithms. SIAM J. Discret. Math. 9 (2) (1996)
Martin Grötschel, Alexander Martin, Robert Weismantel
Packing Steiner trees: polyhedral investigations. Math. Program. 72 (1996)
Martin Grötschel, Clyde L. Monma, Mechthild Stoer
Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements. Oper. Res. 43 (6) (1995)
Martin Grötschel, Alexander Martin, Robert Weismantel
Routing in grid graphs by cutting planes. Math. Methods Oper. Res. 41 (3) (1995)
Martin Grötschel, Joachim Lügger
Neue Produkte - die Funktionen der Beteiligten. Die unendliche Bibliothek (1995)
Carlos E. Ferreira, Martin Grötschel, Alexander Martin, Robert Weismantel, Stefan Kiefl, Ludwig Krispenz
Some integer programs arising in the design of main frame computers. ZOR Methods Model. Oper. Res. 38 (1) (1993)
Martin Grötschel, Alexander Martin, Robert Weismantel
Routing in grid graphs by cutting planes. IPCO (1993)
Norbert Ascheuer, Laureano F. Escudero, Martin Grötschel, Mechthild Stoer
A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing). SIAM J. Optim. 3 (1) (1993)
Michel Deza, Martin Grötschel, Monique Laurent
Clique-Web Facets for Multicut Polytopes. Math. Oper. Res. 17 (4) (1992)
Martin Grötschel, Clyde L. Monma, Mechthild Stoer
Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints. SIAM J. Optim. 2 (3) (1992)
Martin Grötschel, Zaw Win
A cutting plane algorithm for the windy postman problem. Math. Program. 55 (1992)
Martin Grötschel, Clyde L. Monma, Mechthild Stoer
Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints. Oper. Res. 40 (2) (1992)
Martin Grötschel
Theoretical and Practical Aspects of Combinatorial Problem Solving. SODA (1992)
Martin Grötschel, Olaf Holland
Solution of large-scale symmetric travelling salesman problems. Math. Program. 51 (1991)
Martin Grötschel, Michael Jünger, Gerhard Reinelt
Optimal control of plotting and drilling machines: A case study. ZOR Methods Model. Oper. Res. 35 (1) (1991)
Martin Grötschel, Yoshiko Wakabayashi
Facets of the Clique Partitioning Polytope. Math. Program. 47 (1990)
Martin Grötschel, Clyde L. Monma
Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints. SIAM J. Discret. Math. 3 (4) (1990)
Michel Deza, Martin Grötschel, Monique Laurent
Complete Descriptions of Small Multicut Polytopes. Applied Geometry And Discrete Mathematics (1990)
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)
Martin Grötschel, Yoshiko Wakabayashi
A cutting plane algorithm for a clustering problem. Math. Program. 45 (1-3) (1989)
Martin Grötschel, Clyde L. Monma, Mechthild Stoer
Polyhedral Approaches to Network Survivability. Reliability Of Computer And Communication Networks (1989)
Martin Grötschel, Klaus Truemper
Decomposition and optimization over cycles in binary matroids. J. Comb. Theory, Ser. B 46 (3) (1989)
Francisco Barahona, Martin Grötschel, Michael Jünger, Gerhard Reinelt
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design. Oper. Res. 36 (3) (1988)
Martin Grötschel, William R. Pulleyblank
Corrigenda: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem. Math. Oper. Res. 12 (1) (1987)
Martin Grötschel, Olaf Holland
A cutting plane algorithm for minimum perfect 2-matchings. Computing 39 (4) (1987)
Martin Grötschel, William R. Pulleyblank
Clique Tree Inequalities and the Symmetric Travelling Salesman Problem. Math. Oper. Res. 11 (4) (1986)
Francisco Barahona, Martin Grötschel
On the cycle polytope of a binary matroid. J. Comb. Theory, Ser. B 40 (1) (1986)
Martin Grötschel, László Lovász, Alexander Schrijver
Relaxations of vertex packing. J. Comb. Theory, Ser. B 40 (3) (1986)
Martin Grötschel, Olaf Holland
Solving matching problems with linear programming. Math. Program. 33 (3) (1985)
Francisco Barahona, Martin Grötschel, Ali Ridha Mahjoub
Facets of the Bipartite Subgraph Polytope. Math. Oper. Res. 10 (2) (1985)
Martin Grötschel, Michael Jünger, Gerhard Reinelt
On the acyclic subgraph polytope. Math. Program. 33 (1) (1985)
Martin Grötschel, Michael Jünger, Gerhard Reinelt
Facets of the linear ordering polytope. Math. Program. 33 (1) (1985)
Martin Grötschel, Michael Jünger, Gerhard Reinelt
A Cutting Plane Algorithm for the Linear Ordering Problem. Oper. Res. 32 (6) (1984)
Martin Grötschel, George L. Nemhauser
A polynomial algorithm for the max-cut problem on graphs without long odd cycles. Math. Program. 29 (1) (1984)
Martin Grötschel, László Lovász, Alexander Schrijver
Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization". Comb. 4 (4) (1984)
Achim Bachem, Bernhard Korte, Martin Grötschel
Scientific Program. ISMP (1982)
Martin Grötschel, László Lovász, Alexander Schrijver
The ellipsoid method and its consequences in combinatorial optimization. Comb. 1 (2) (1981)
Martin Grötschel, Yoshiko Wakabayashi
On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. Discret. Math. 34 (1) (1981)
Martin Grötschel, William R. Pulleyblank
Weakly bipartite graphs and the Max-cut problem. Oper. Res. Lett. 1 (1) (1981)
Martin Grötschel
On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets. Math. Oper. Res. 5 (2) (1980)
Martin Grötschel, Carsten Thomassen, Yoshiko Wakabayashi
Hypotraceable digraphs. J. Graph Theory 4 (4) (1980)
Martin Grötschel, Frank Harary
The graphs for which all strong orientations are hamiltonian. J. Graph Theory 3 (3) (1979)
Martin Grötschel, Manfred Padberg
On the symmetric travelling salesman problem II: Lifting theorems and facets. Math. Program. 16 (1) (1979)
Martin Grötschel, Manfred Padberg
On the symmetric travelling salesman problem I: Inequalities. Math. Program. 16 (1) (1979)
J. Wilhelm, Martin Grötschel, E. Mezgolits, Ernst Strohmeier, Ernst Unsin, Klaus Brockhoff, Dietrich Ohse
Buchbesprechungen. Z. Oper. Research 23 (4) (1979)
Martin Grötschel
On minimal strong blocks. J. Graph Theory 3 (3) (1979)
Martin Grötschel, Rabe von Randow
A property of continuous unbounded algorithms. Math. Program. 14 (1) (1978)
Martin Grötschel, Manfred W. Padberg
Lineare Charakterisierungen von Travelling Salesman Problemen. Math. Methods Oper. Res. 21 (1) (1977)
Martin Grötschel, Manfred W. Padberg
Partial linear characterizations of the asymmetric travelling salesman polytope. Math. Program. 8 (1) (1975)