Martin Grötschel

79 papers A* 1B 2Journal 62Unranked 9

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