Martin Grötschel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Martin Grötschel has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Martin Henk
Institut für Mathematik, Technische Universität Berlin, Berlin, Germany
4 shared publications Hartwig Bosse
Technische Universität Berlin
1 shared publication- Hartwig Bosse1 shared publication
- Jörg Rambau
Konrad-Zuse-Zentrum für Informantionstechnik
1 shared publication - Jörg Rambau
Lehrstuhl für Wirtschaftsmathematik Universität Bayreuth Germany
1 shared publication - Klaus Lucas
RWTH Aachen
1 shared publication
Latest Publications
- 27 December 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS)
Martin Grotschel
- 27 December 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS)
Martin Grotschel
- 15 December 2012
- Published by Springer Nature
- p. 161-172
Lagenwechsel minimieren – oder das Bohren von Löchern in Leiterplatten
- 15 December 2012
- Published by Springer Nature
- p. 161-172
Lagenwechsel minimieren – oder das Bohren von Löchern in Leiterplatten
- 1 January 2010
- Published by Springer Nature
- p. 1-6
Introduction
- 23 May 2007
- Published by Springer Nature in OR Spectrum
- Vol. 30 (3) , 453-468
Mathematical methods for physical layout of printed circuit boards: an overview
- 23 May 2007
- Published by Springer Nature in OR Spectrum
- Vol. 30 (3) , 453-468
Mathematical methods for physical layout of printed circuit boards: an overview
- 9 February 2005
- Published by Springer Nature in Mathematical Programming
- Vol. 103 (1) , 35-44
Polynomial inequalities representing polyhedra
- 9 February 2005
- Published by Springer Nature in Mathematical Programming
- Vol. 103 (1) , 35-44
Polynomial inequalities representing polyhedra
- Open Access
Polynomial inequalities representing polyhedra
Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound 2n-2 and for arbitrary polyhedra we get a constructible representation by 2n polynomial inequalities.
Open AccessPolynomial inequalities representing polyhedra
Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound 2n-2 and for arbitrary polyhedra we get a constructible representation by 2n polynomial inequalities.
- Open Access
- 1 May 2003
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 29 (4) , 485-504
The Representation of Polyhedra by Polynomial Inequalities
- 1 May 2003
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 29 (4) , 485-504
Open AccessThe Representation of Polyhedra by Polynomial Inequalities
- Open Access
On the representation of polyhedra by polynomial inequalities
A beautiful result of Br\"ocker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most $d(d+1)/2$ polynomial inequalities. Even in this polyhedral case, however, no constructive proof is known, even if the quadratic upper bound is replaced by any bound depending only on the dimension. Here we give, for simple polytopes, an explicit construction of polynomials describing such a polytope. The number of used polynomials is exponential in the dimension, but in the 2- and 3-dimensional case we get the expected number $d(d+1)/2$.Open AccessOn the representation of polyhedra by polynomial inequalities
A beautiful result of Br\"ocker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most $d(d+1)/2$ polynomial inequalities. Even in this polyhedral case, however, no constructive proof is known, even if the quadratic upper bound is replaced by any bound depending only on the dimension. Here we give, for simple polytopes, an explicit construction of polynomials describing such a polytope. The number of used polynomials is exponential in the dimension, but in the 2- and 3-dimensional case we get the expected number $d(d+1)/2$.