- CSB - MetaPress - Google - Bing - Yahoo
 | 2008 | |
|---|---|---|
| j24 |      | Martin Grötschel, George L. Nemhauser: George Dantzig's contributions to integer programming. Discrete Optimization 5(2): 168-173 (2008) |
| 2007 | ||
| j23 | | Ralf Borndörfer, Martin Grötschel, Marc E. Pfetsch: A Column-Generation Approach to Line Planning in Public Transport. Transportation Science 41(1): 123-132 (2007) |
| 2005 | ||
| j22 | | Hartwig Bosse, Martin Grötschel, Martin Henk: Polynomial inequalities representing polyhedra. Math. Program. 103(1): 35-44 (2005) |
| 2003 | ||
| j21 | | Martin Grötschel, Martin Henk: The Representation of Polyhedra by Polynomial Inequalities. Discrete & Computational Geometry 29(4): 485-504 (2003) |
| 2002 | ||
| j20 | | Andreas Eisenblätter, Martin Grötschel, Arie M. C. A. Koster: Frequency planning and ramifications of coloring. Discussiones Mathematicae Graph Theory 22(1): 51-88 (2002) |
| 2001 | ||
| c7 | | Gabriele Beger, Peter Diepold, Martin Grötschel, Maximilian Herberger, Stephan Ory, Roland Schwänzl: Panel: Legal Aspects of Information Systems. IuK 2001 |
| c6 |  | |
| 2000 | ||
| j19 | | 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) |
| c5 | | |
| 1999 | ||
| j18 | | Norbert Ascheuer, Martin Grötschel, Atef Abdel-Aziz Abdel-Hamid: Order picking in an automatic warehouse: Solving online asymmetric TSPs. Math. Meth. of OR 49(3): 501-515 (1999) |
| 1997 | ||
| j17 | | Martin Grötschel, Alexander Martin, Robert Weismantel: The Steiner tree packing problem in VLSI design. Math. Program. 77: 265-281 (1997) |
| 1996 | ||
| j16 | | Martin Grötschel, Alexander Martin, Robert Weismantel: Packing Steiner Trees: Further Facets. Eur. J. Comb. 17(1): 39-52 (1996) |
| j15 | | Martin Grötschel, Alexander Martin, Robert Weismantel: Packing Steiner trees: polyhedral investigations. Math. Program. 72: 101-123 (1996) |
| j14 | | Martin Grötschel, Alexander Martin, Robert Weismantel: Packing Steiner trees: a cutting plane algorithm and computational results. Math. Program. 72: 125-145 (1996) |
| j13 | | Martin Grötschel, Alexander Martin, Robert Weismantel: Packing Steiner Trees: Separation Algorithms. SIAM J. Discrete Math. 9(2): 233-257 (1996) |
| 1995 | ||
| j12 | | Martin Grötschel, Alexander Martin, Robert Weismantel: Routing in grid graphs by cutting planes. Math. Meth. of OR 41(3): 255-275 (1995) |
| c4 | | Martin Grötschel, Joachim Lügger: Neue Produkte - die Funktionen der Beteiligten. Die unendliche Bibliothek 1995: 38-67 |
| 1993 | ||
| j11 | | Carlos Edwards Ferreira, Martin Grötschel, Alexander Martin, Robert Weismantel, Stefan Kiefl, Ludwig Krispenz: Some integer programs arising in the design of main frame computers. Math. Meth. of OR 38(1): 77-100 (1993) |
| c3 | | Martin Grötschel, Alexander Martin, Robert Weismantel: Routing in grid graphs by cutting planes. IPCO 1993: 447-461 |
| 1992 | ||
| j10 | | Martin Grötschel, Zaw Win: A cutting plane algorithm for the windy postman problem. Math. Program. 55: 339-358 (1992) |
| c2 | | Martin Grötschel: Theoretical and Practical Aspects of Combinatorial Problem Solving. SODA 1992: 195 |
| 1991 | ||
| j9 | | Martin Grötschel, Olaf Holland: Solution of large-scale symmetric travelling salesman problems. Math. Program. 51: 141-202 (1991) |
| 1990 | ||
| j8 | | Martin Grötschel, Yoshiko Wakabayashi: Facets of the Clique Partitioning Polytope. Math. Program. 47: 367-387 (1990) |
| j7 | | Martin Grötschel, Clyde L. Monma: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints. SIAM J. Discrete Math. 3(4): 502-523 (1990) |
| c1 | | 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 | ||
| j6 | | Martin Grötschel, Klaus Truemper: Decomposition and optimization over cycles in binary matroids. J. Comb. Theory, Ser. B 46(3): 306-337 (1989) |
| 1986 | ||
| j5 | | Francisco Barahona, Martin Grötschel: On the cycle polytope of a binary matroid. J. Comb. Theory, Ser. B 40(1): 40-62 (1986) |
| j4 | | Martin Grötschel, László Lovász, Alexander Schrijver: Relaxations of vertex packing. J. Comb. Theory, Ser. B 40(3): 330-343 (1986) |
| 1984 | ||
| j3 | | Martin Grötschel, László Lovász, Alexander Schrijver: Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization". Combinatorica 4(4): 291-295 (1984) |
| 1981 | ||
| j2 | | Martin Grötschel, László Lovász, Alexander Schrijver: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2): 169-197 (1981) |
| j1 | | Martin Grötschel, Yoshiko Wakabayashi: On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. Discrete Mathematics 34(1): 43-59 (1981) |
Colors in the list of coauthors
Last update Sat May 18 13:05:05 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page