Martin Grötschel

From MaRDI portal
Person:202055

Available identifiers

zbMath Open grotschel.martinDBLPg/MGrotschelFactGridQ885804WikidataQ1903911 ScholiaQ1903911MaRDI QIDQ202055

List of research outcomes





PublicationDate of PublicationType
Comments on “An Exact Method for the Minimum Feedback Arc Set Problem”2024-04-14Paper
Optimization Stories2023-11-30Paper
The Mathematics of L\'aszl\'o Lov\'asz2023-03-06Paper
Mathematical Berlin. Science, sights, and stories2016-09-30Paper
"Einsteins Notizblock". BertelsmannSpringer und die Zukunft der wissenschaftlichen Publikation2016-01-21Paper
Towards optimizing the deployment of optical access networks2015-01-28Paper
Characterization of facets of the hop constrained chain polytope via dynamic programming2014-09-12Paper
Euler, Mei-ko Kwan, Königsberg, and a Chinese postman2013-04-17Paper
Stories about the old masters of optimization2013-04-17Paper
Introduction2013-04-17Paper
Flinders Petrie, the travelling salesman problem, and the beginning of mathematical modeling in archaeology2013-04-17Paper
Introduction2010-12-28Paper
Planning Problems in Public Transit2010-12-28Paper
Mathematical methods for physical layout of printed circuit boards: an overview2010-09-08Paper
https://portal.mardi4nfdi.de/entity/Q36455772009-11-18Paper
Discrete mathematics and its applications: On the road to an authentical mathematics education2009-05-19Paper
https://portal.mardi4nfdi.de/entity/Q53017262009-01-20Paper
George Dantzig's contributions to integer programming2008-10-29Paper
https://portal.mardi4nfdi.de/entity/Q35254362008-09-12Paper
\texttt{MATHEON}: Introducing the DFG research center ``Mathematics for key technologies in Berlin2006-02-06Paper
https://portal.mardi4nfdi.de/entity/Q57060972005-11-04Paper
https://portal.mardi4nfdi.de/entity/Q54651122005-08-22Paper
Polynomial inequalities representing polyhedra2005-05-12Paper
https://portal.mardi4nfdi.de/entity/Q44724342004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44505202004-02-15Paper
https://portal.mardi4nfdi.de/entity/Q44943992003-08-26Paper
The representation of polyhedra by polynomial inequalities2003-08-21Paper
\(\mathcal P = \mathcal{NP}\)?2003-08-20Paper
https://portal.mardi4nfdi.de/entity/Q27625782002-02-21Paper
Frequency planning and ramifications of coloring2002-01-01Paper
A polyhedral study of the asymmetric traveling salesman problem with time windows2001-11-16Paper
https://portal.mardi4nfdi.de/entity/Q49501192001-10-14Paper
https://portal.mardi4nfdi.de/entity/Q45176752001-08-05Paper
Solving the asymmetric travelling salesman problem with time windows by branch-and-cut2001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q27625772001-01-01Paper
Order picking in an automatic warehouse: Solving online asymmetric TSPs2000-06-04Paper
https://portal.mardi4nfdi.de/entity/Q46993872000-02-01Paper
https://portal.mardi4nfdi.de/entity/Q42341611999-03-16Paper
Frequency assignment in cellular phone networks1998-09-20Paper
The Steiner tree packing problem in VLSI design1998-06-22Paper
https://portal.mardi4nfdi.de/entity/Q43841001998-05-25Paper
https://portal.mardi4nfdi.de/entity/Q43841181998-05-25Paper
https://portal.mardi4nfdi.de/entity/Q43841271998-05-17Paper
Cost-efficient network synthesis from leased lines1998-04-02Paper
https://portal.mardi4nfdi.de/entity/Q48717851998-02-04Paper
https://portal.mardi4nfdi.de/entity/Q43531361997-12-11Paper
Optimum path packing on wheels: The consecutive case1997-01-06Paper
Packing Steiner trees: A cutting plane algorithm and computational results1997-01-06Paper
Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements1996-10-13Paper
Packing Steiner Trees: Separation Algorithms1996-10-03Paper
Packing Steiner trees: Further facets1996-07-14Paper
https://portal.mardi4nfdi.de/entity/Q48453721996-06-25Paper
Routing in grid graphs by cutting planes1996-05-30Paper
https://portal.mardi4nfdi.de/entity/Q48717761996-04-08Paper
Packing Steiner trees: Polyhedral investigations1996-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47634061995-04-11Paper
https://portal.mardi4nfdi.de/entity/Q43082871994-10-26Paper
Geometric algorithms and combinatorial optimization.1993-11-28Paper
Some integer programs arising in the design of main frame computers1993-09-21Paper
https://portal.mardi4nfdi.de/entity/Q52888331993-09-02Paper
A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)1993-06-29Paper
Geometric algorithms and combinatorial optimization1993-06-05Paper
https://portal.mardi4nfdi.de/entity/Q40353611993-05-18Paper
Clique-Web Facets for Multicut Polytopes1993-03-01Paper
Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints1993-01-16Paper
A cutting plane algorithm for the windy postman problem1993-01-16Paper
Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39749691992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39720011992-06-25Paper
Optimal control of plotting and drilling machines: A case study1991-01-01Paper
Solution of large-scale symmetric travelling salesman problems1991-01-01Paper
Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints1990-01-01Paper
Facets of the clique partitioning polytope1990-01-01Paper
Via Minimization with Pin Preassignments and Layer Preference1989-01-01Paper
A cutting plane algorithm for a clustering problem1989-01-01Paper
Decomposition and optimization over cycles in binary matroids1989-01-01Paper
Master polytopes for cycles of binary matroids1989-01-01Paper
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design1988-01-01Paper
A cutting plane algorithm for minimum perfect 2-matchings1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38353061986-01-01Paper
Clique Tree Inequalities and the Symmetric Travelling Salesman Problem1986-01-01Paper
On the cycle polytope of a binary matroid1986-01-01Paper
Relaxations of vertex packing1986-01-01Paper
Solving matching problems with linear programming1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37149001985-01-01Paper
Facets of the linear ordering polytope1985-01-01Paper
Facets of the Bipartite Subgraph Polytope1985-01-01Paper
On the acyclic subgraph polytope1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36806061985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37149011985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32166861984-01-01Paper
Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization1984-01-01Paper
A Cutting Plane Algorithm for the Linear Ordering Problem1984-01-01Paper
A polynomial algorithm for the max-cut problem on graphs without long odd cycles1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33292251984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33188071984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33426101984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36775081984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39395991982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39443531982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39344151981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39451541981-01-01Paper
The ellipsoid method and its consequences in combinatorial optimization1981-01-01Paper
Characterizations of adjacency of faces of polyhedra1981-01-01Paper
Weakly bipartite graphs and the max-cut problem1981-01-01Paper
On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets1981-01-01Paper
On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39582891981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33282861981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38936631980-01-01Paper
On the symmetric travelling salesman problem: Solution of a 120-city problem1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38759561980-01-01Paper
Hypotraceable digraphs1980-01-01Paper
On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38661491979-01-01Paper
On the symmetric travelling salesman problem I: Inequalities1979-01-01Paper
On the symmetric travelling salesman problem II: Lifting theorems and facets1979-01-01Paper
On minimal strong blocks1979-01-01Paper
The graphs for which all strong orientations are hamiltonian1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32066611978-01-01Paper
A property of continuous unbounded algorithms1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41731901978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32052461977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41731481977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41893191977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41336591977-01-01Paper
Lineare Charakterisierungen von Travelling Salesman Problemen1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41745171977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40834741976-01-01Paper
Partial linear characterizations of the asymmetric travelling salesman polytope1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40746691974-01-01Paper

Research outcomes over time

This page was built for person: Martin Grötschel