default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Grötschel
Books and Theses
- 2016
[b2]Iris Grötschel, Martin Grötschel:
Mathematical Berlin - Science, Sights and Stories. Berlin Story Verlag 2016, ISBN 978-3-9572308-0-5, pp. 1-159- 1988
- [b1]Martin Grötschel, László Lovász, Alexander Schrijver:
Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics 2, Springer 1988, ISBN 978-3-642-97883-8
Journal Articles
- 2022
- [j61]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: 1.3:1-1.3:4 (2022) - 2018
- [j60]Martin Grötschel:
APE 2018: Academic Publishing in Europe, Introduction. Inf. Serv. Use 38(4): 191-192 (2018) - 2014
- [j59]Martin Grötschel, Rüdiger Stephan:
Characterization of facets of the hop constrained chain polytope via dynamic programming. Discret. Appl. Math. 162: 229-246 (2014) - [j58]Martin Grötschel, Christian Raack, Axel Werner:
Towards optimizing the deployment of optical access networks. EURO J. Comput. Optim. 2(1-2): 17-53 (2014) - 2008
- [j57]Martin Grötschel, George L. Nemhauser:
George Dantzig's contributions to integer programming. Discret. Optim. 5(2): 168-173 (2008) - [j56]Nadine Abboud, Martin Grötschel, Thorsten Koch
:
Mathematical methods for physical layout of printed circuit boards: an overview. OR Spectr. 30(3): 453 (2008) - 2007
- [j55]Ralf Borndörfer, Martin Grötschel, Marc E. Pfetsch:
A Column-Generation Approach to Line Planning in Public Transport. Transp. Sci. 41(1): 123-132 (2007) - 2005
- [j54]Hartwig Bosse, Martin Grötschel, Martin Henk:
Polynomial inequalities representing polyhedra. Math. Program. 103(1): 35-44 (2005) - 2003
- [j53]Martin Grötschel, Martin Henk:
The Representation of Polyhedra by Polynomial Inequalities. Discret. Comput. Geom. 29(4): 485-504 (2003) - 2002
- [j52]Andreas Eisenblätter, Martin Grötschel, Arie M. C. A. Koster:
Frequency planning and ramifications of coloring. Discuss. Math. Graph Theory 22(1): 51-88 (2002) - 2001
- [j51]Norbert Ascheuer, Matteo Fischetti, Martin Grötschel:
Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut. Math. Program. 90(3): 475-506 (2001) - 2000
- [j50]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) - 1999
- [j49]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): 501-515 (1999) - 1998
- [j48]Dimitris Alevras, Martin Grötschel, Roland Wessäly:
Cost-efficient network synthesis from leased lines. Ann. Oper. Res. 76: 1-20 (1998) - [j47]Ralf Borndörfer, Andreas Eisenblätter, Martin Grötschel, Alexander Martin:
Frequency assignment in cellular phone networks. Ann. Oper. Res. 76: 73-93 (1998) - [j46]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): 88-93 (1998) - 1997
- [j45]Martin Grötschel, Alexander Martin, Robert Weismantel:
The Steiner tree packing problem in VLSI design. Math. Program. 77: 265-281 (1997) - 1996
- [j44]Martin Grötschel, Alexander Martin, Robert Weismantel:
Packing Steiner Trees: Further Facets. Eur. J. Comb. 17(1): 39-52 (1996) - [j43]Martin Grötschel, Alexander Martin, Robert Weismantel:
Packing Steiner trees: polyhedral investigations. Math. Program. 72: 101-123 (1996) - [j42]Martin Grötschel, Alexander Martin, Robert Weismantel:
Packing Steiner trees: a cutting plane algorithm and computational results. Math. Program. 72: 125-145 (1996) - [j41]Martin Grötschel, Alexander Martin, Robert Weismantel:
Packing Steiner Trees: Separation Algorithms. SIAM J. Discret. Math. 9(2): 233-257 (1996) - 1995
- [j40]Martin Grötschel, Clyde L. Monma, Mechthild Stoer:
Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements. Oper. Res. 43(6): 1012-1024 (1995) - [j39]Martin Grötschel, Alexander Martin, Robert Weismantel:
Routing in grid graphs by cutting planes. Math. Methods Oper. Res. 41(3): 255-275 (1995) - 1993
- [j38]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): 77-100 (1993) - [j37]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): 25-42 (1993) - 1992
- [j36]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): 309-330 (1992) - [j35]Michel Deza, Martin Grötschel, Monique Laurent:
Clique-Web Facets for Multicut Polytopes. Math. Oper. Res. 17(4): 981-1000 (1992) - [j34]Martin Grötschel, Zaw Win:
A cutting plane algorithm for the windy postman problem. Math. Program. 55: 339-358 (1992) - [j33]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): 474-504 (1992) - 1991
- [j32]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): 61-84 (1991) - [j31]Martin Grötschel, Olaf Holland:
Solution of large-scale symmetric travelling salesman problems. Math. Program. 51: 141-202 (1991) - 1990
- [j30]Martin Grötschel, Yoshiko Wakabayashi:
Facets of the Clique Partitioning Polytope. Math. Program. 47: 367-387 (1990) - [j29]Martin Grötschel, Clyde L. Monma:
Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints. SIAM J. Discret. Math. 3(4): 502-523 (1990) - 1989
- [j28]Martin Grötschel, Klaus Truemper:
Decomposition and optimization over cycles in binary matroids. J. Comb. Theory B 46(3): 306-337 (1989) - [j27]Martin Grötschel, Yoshiko Wakabayashi:
A cutting plane algorithm for a clustering problem. Math. Program. 45(1-3): 59-96 (1989) - 1988
- [j26]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): 493-513 (1988) - 1987
- [j25]Martin Grötschel, Olaf Holland:
A cutting plane algorithm for minimum perfect 2-matchings. Computing 39(4): 327-344 (1987) - [j24]Martin Grötschel, William R. Pulleyblank:
Corrigenda: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem. Math. Oper. Res. 12(1): 182-184 (1987) - 1986
- [j23]Francisco Barahona, Martin Grötschel:
On the cycle polytope of a binary matroid. J. Comb. Theory B 40(1): 40-62 (1986) - [j22]Martin Grötschel, László Lovász, Alexander Schrijver:
Relaxations of vertex packing. J. Comb. Theory B 40(3): 330-343 (1986) - [j21]Martin Grötschel, William R. Pulleyblank:
Clique Tree Inequalities and the Symmetric Travelling Salesman Problem. Math. Oper. Res. 11(4): 537-569 (1986) - 1985
- [j20]Francisco Barahona, Martin Grötschel, Ali Ridha Mahjoub:
Facets of the Bipartite Subgraph Polytope. Math. Oper. Res. 10(2): 340-358 (1985) - [j19]Martin Grötschel, Michael Jünger, Gerhard Reinelt:
On the acyclic subgraph polytope. Math. Program. 33(1): 28-42 (1985) - [j18]Martin Grötschel, Michael Jünger, Gerhard Reinelt:
Facets of the linear ordering polytope. Math. Program. 33(1): 43-60 (1985) - [j17]Martin Grötschel, Olaf Holland:
Solving matching problems with linear programming. Math. Program. 33(3): 243-259 (1985) - 1984
- [j16]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): 291-295 (1984) - [j15]Martin Grötschel, Michael Jünger, Gerhard Reinelt:
A Cutting Plane Algorithm for the Linear Ordering Problem. Oper. Res. 32(6): 1195-1220 (1984) - [j14]Martin Grötschel, George L. Nemhauser:
A polynomial algorithm for the max-cut problem on graphs without long odd cycles. Math. Program. 29(1): 28-40 (1984) - 1981
- [j13]Martin Grötschel, László Lovász, Alexander Schrijver:
The ellipsoid method and its consequences in combinatorial optimization. Comb. 1(2): 169-197 (1981) - [j12]Martin Grötschel, Yoshiko Wakabayashi:
On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. Discret. Math. 34(1): 43-59 (1981) - [j11]Martin Grötschel, William R. Pulleyblank:
Weakly bipartite graphs and the Max-cut problem. Oper. Res. Lett. 1(1): 23-27 (1981) - 1980
- [j10]Martin Grötschel, Carsten Thomassen, Yoshiko Wakabayashi:
Hypotraceable digraphs. J. Graph Theory 4(4): 377-381 (1980) - [j9]Martin Grötschel:
On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets. Math. Oper. Res. 5(2): 285-292 (1980) - 1979
- [j8]Martin Grötschel:
On minimal strong blocks. J. Graph Theory 3(3): 213-219 (1979) - [j7]Martin Grötschel, Frank Harary:
The graphs for which all strong orientations are hamiltonian. J. Graph Theory 3(3): 221-223 (1979) - [j6]J. Wilhelm, Martin Grötschel, E. Mezgolits, Ernst Strohmeier, Ernst Unsin, Klaus Brockhoff, Dietrich Ohse:
Buchbesprechungen. Z. Oper. Research 23(4): B126-B130 (1979) - [j5]Martin Grötschel, Manfred Padberg:
On the symmetric travelling salesman problem I: Inequalities. Math. Program. 16(1): 265-280 (1979) - [j4]Martin Grötschel, Manfred Padberg:
On the symmetric travelling salesman problem II: Lifting theorems and facets. Math. Program. 16(1): 281-302 (1979) - 1978
- [j3]Martin Grötschel, Rabe von Randow:
A property of continuous unbounded algorithms. Math. Program. 14(1): 373-377 (1978) - 1977
- [j2]Martin Grötschel, Manfred W. Padberg:
Lineare Charakterisierungen von Travelling Salesman Problemen. Math. Methods Oper. Res. 21(1): 33-64 (1977) - 1975
- [j1]Martin Grötschel, Manfred W. Padberg:
Partial linear characterizations of the asymmetric travelling salesman polytope. Math. Program. 8(1): 378-381 (1975)
Conference and Workshop Papers
- 2002
- [c12]Martin Grötschel, Sven Oliver Krumke, Jörg Rambau, Luis Miguel Torres:
Online-Dispatching of Automobile Service Units. OR 2002: 168-173 - 2001
- [c11]Gabriele Beger, Peter Diepold, Martin Grötschel, Maximilian Herberger, Stephan Ory, Roland Schwänzl:
Panel: Legal Aspects of Information Systems. IuK 2001 - [c10]Martin Grötschel:
Cooperative Scientific Digital Libraries. IuK 2001 - 2000
- [c9]Martin Grötschel:
Frequency Assignment in Mobile Phone Systems. FSTTCS 2000: 81-86 - 1998
- [c8]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: 1-16 - 1995
- [c7]Martin Grötschel, Joachim Lügger:
Neue Produkte - die Funktionen der Beteiligten. Die unendliche Bibliothek 1995: 38-67 - 1993
- [c6]Martin Grötschel, Alexander Martin, Robert Weismantel:
Routing in grid graphs by cutting planes. IPCO 1993: 447-461 - 1992
- [c5]Martin Grötschel:
Theoretical and Practical Aspects of Combinatorial Problem Solving. SODA 1992: 195 - 1990
- [c4]Michel Deza, Martin Grötschel, Monique Laurent:
Complete Descriptions of Small Multicut Polytopes. Applied Geometry And Discrete Mathematics 1990: 221-252 - [c3]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 - 1989
- [c2]Martin Grötschel, Clyde L. Monma, Mechthild Stoer:
Polyhedral Approaches to Network Survivability. Reliability Of Computer And Communication Networks 1989: 121-142 - 1982
- [c1]Achim Bachem, Bernhard Korte, Martin Grötschel:
Scientific Program. ISMP 1982: 605-648
Parts in Books or Collections
- 2004
- [p1]Martin Grötschel:
Cardinality Homogeneous Set Systems, Cycles in Matroids, and Associated Polytopes. The Sharpest Cut 2004: 99-120
Editorship
- 2004
- [e2]Martin Grötschel:
The Sharpest Cut. MPS-SIAM series on optimization 4, SIAM 2004, ISBN 978-0-89871-552-1 [contents] - 1983
- [e1]Achim Bachem, Bernhard Korte, Martin Grötschel:
Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982. Springer 1983, ISBN 978-3-642-68876-8 [contents]
Informal and Other Publications
- 2023
- [i1]Martin Grötschel, Jaroslav Nesetril:
The Mathematics of László Lovász. CoRR abs/2303.03148 (2023)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
