Martin Grötschel

Jaroslav Nesetril

CoRR, 2023

2022

Comments on "An Exact Method for the Minimum Feedback Arc Set Problem".

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2022

2018

APE 2018: Academic Publishing in Europe, Introduction.

[BibT_eX]

[DOI]

Inf. Serv. Use, 2018

2016

Mathematical Berlin - Science, Sights and Stories.

[BibT_eX]

[DOI]

Iris Grötschel

Berlin Story Verlag, ISBN: 978-3-9572308-0-5, 2016

2014

Towards optimizing the deployment of optical access networks.

[BibT_eX]

[DOI]

Christian Raack

Axel Werner

EURO J. Comput. Optim., 2014

Characterization of facets of the hop constrained chain polytope via dynamic programming.

[BibT_eX]

[DOI]

Rüdiger Stephan

Discret. Appl. Math., 2014

2008

Mathematical methods for physical layout of printed circuit boards: an overview.

[BibT_eX]

[DOI]

Nadine Abboud

Thorsten Koch

OR Spectr., 2008

George Dantzig's contributions to integer programming.

[BibT_eX]

[DOI]

George L. Nemhauser

Discret. Optim., 2008

2007

A Column-Generation Approach to Line Planning in Public Transport.

[BibT_eX]

[DOI]

Ralf Borndörfer

Marc E. Pfetsch

Transp. Sci., 2007

2005

Polynomial inequalities representing polyhedra.

[BibT_eX]

[DOI]

Hartwig Bosse

Martin Henk

Math. Program., 2005

2004

Cardinality Homogeneous Set Systems, Cycles in Matroids, and Associated Polytopes.

[BibT_eX]

[DOI]

Proceedings of the Sharpest Cut, 2004

2003

The Representation of Polyhedra by Polynomial Inequalities.

[BibT_eX]

[DOI]

Martin Henk

Discret. Comput. Geom., 2003

2002

Frequency planning and ramifications of coloring.

[BibT_eX]

[DOI]

Andreas Eisenblätter

Arie M. C. A. Koster

Discuss. Math. Graph Theory, 2002

Online-Dispatching of Automobile Service Units.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2002, 2002

2001

Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut.

[BibT_eX]

[DOI]

Norbert Ascheuer

Matteo Fischetti

Math. Program., 2001

Cooperative Scientific Digital Libraries.

[BibT_eX]

Proceedings of the 7th Annual Meeting of the IuK Initiative Information and Communication of the Learned Societies in Germany, 2001

Panel: Legal Aspects of Information Systems.

[BibT_eX]

[DOI]

Proceedings of the 7th Annual Meeting of the IuK Initiative Information and Communication of the Learned Societies in Germany, 2001

2000

A polyhedral study of the asymmetric traveling salesman problem with time windows.

[BibT_eX]

[DOI]

Norbert Ascheuer

Matteo Fischetti

Networks, 2000

Frequency Assignment in Mobile Phone Systems.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999

Order picking in an automatic warehouse: Solving online asymmetric TSPs.

[BibT_eX]

[DOI]

Norbert Ascheuer

Atef Abdel-Aziz Abdel-Hamid

Math. Methods Oper. Res., 1999

1998

Survivable mobile phone network architectures: models and solution methods.

[BibT_eX]

[DOI]

IEEE Commun. Mag., 1998

Frequency assignment in cellular phone networks.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1998

Cost-efficient network synthesis from leased lines.

[BibT_eX]

[DOI]

Dimitris Alevras

Roland Wessäly

Ann. Oper. Res., 1998

Design of broadband virtual private networks: Model and heuristics for the B-WiN.

[BibT_eX]

[DOI]

Andreas Bley

Roland Wessäly

Proceedings of the Robust Communication Networks: Interconnection and Survivability, 1998

1997

The Steiner tree packing problem in VLSI design.

[BibT_eX]

[DOI]

Math. Program., 1997

1996

Packing Steiner Trees: Separation Algorithms.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1996

Packing Steiner trees: a cutting plane algorithm and computational results.

[BibT_eX]

[DOI]

Math. Program., 1996

Packing Steiner trees: polyhedral investigations.

[BibT_eX]

[DOI]

Math. Program., 1996

Packing Steiner Trees: Further Facets.

[BibT_eX]

[DOI]

Eur. J. Comb., 1996

1995

Routing in grid graphs by cutting planes.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1995

Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements.

[BibT_eX]

[DOI]

Oper. Res., 1995

Neue Produkte - die Funktionen der Beteiligten.

[BibT_eX]

[DOI]

Joachim Lügger

Proceedings of the Die unendliche Bibliothek, 1995

1993

A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing).

[BibT_eX]

[DOI]

SIAM J. Optim., 1993

Some integer programs arising in the design of main frame computers.

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1993

1992

Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints.

[BibT_eX]

[DOI]

SIAM J. Optim., 1992

A cutting plane algorithm for the windy postman problem.

[BibT_eX]

[DOI]

Zaw Win

Math. Program., 1992

Clique-Web Facets for Multicut Polytopes.

[BibT_eX]

[DOI]

Michel Deza

Monique Laurent

Math. Oper. Res., 1992

Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints.

[BibT_eX]

[DOI]

Oper. Res., 1992

Theoretical and Practical Aspects of Combinatorial Problem Solving.

[BibT_eX]

[DOI]

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

1991

Solution of large-scale symmetric travelling salesman problems.

[BibT_eX]

[DOI]

Olaf Holland

Math. Program., 1991

Optimal control of plotting and drilling machines: A case study.

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1991

1990

Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

Facets of the Clique Partitioning Polytope.

[BibT_eX]

[DOI]

Math. Program., 1990

On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem.

[BibT_eX]

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

Complete Descriptions of Small Multicut Polytopes.

[BibT_eX]

[DOI]

Michel Deza

Monique Laurent

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989

A cutting plane algorithm for a clustering problem.

[BibT_eX]

[DOI]

Math. Program., 1989

Decomposition and optimization over cycles in binary matroids.

[BibT_eX]

[DOI]

Klaus Truemper

J. Comb. Theory, Ser. B, 1989

Polyhedral Approaches to Network Survivability.

[BibT_eX]

[DOI]

Proceedings of the Reliability Of Computer And Communication Networks, 1989

1988

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design.

[BibT_eX]

[DOI]

Oper. Res., 1988

Geometric Algorithms and Combinatorial Optimization

[BibT_eX]

[DOI]

Algorithms and Combinatorics 2, Springer, ISBN: 978-3-642-97881-4, 1988

1987

Corrigenda: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem.

[BibT_eX]

[DOI]

William R. Pulleyblank

Math. Oper. Res., 1987

A cutting plane algorithm for minimum perfect 2-matchings.

[BibT_eX]

[DOI]

Olaf Holland

Computing, 1987

1986

Clique Tree Inequalities and the Symmetric Travelling Salesman Problem.

[BibT_eX]

[DOI]

William R. Pulleyblank

Math. Oper. Res., 1986

Relaxations of vertex packing.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1986

On the cycle polytope of a binary matroid.

[BibT_eX]

[DOI]

Francisco Barahona

J. Comb. Theory, Ser. B, 1986

1985

Facets of the linear ordering polytope.

[BibT_eX]

[DOI]

Math. Program., 1985

On the acyclic subgraph polytope.

[BibT_eX]

[DOI]

Math. Program., 1985

Solving matching problems with linear programming.

[BibT_eX]

[DOI]

Olaf Holland

Math. Program., 1985

Facets of the Bipartite Subgraph Polytope.

[BibT_eX]

[DOI]

Francisco Barahona

Ali Ridha Mahjoub

Math. Oper. Res., 1985

1984

A polynomial algorithm for the max-cut problem on graphs without long odd cycles.

[BibT_eX]

[DOI]

George L. Nemhauser

Math. Program., 1984

A Cutting Plane Algorithm for the Linear Ordering Problem.

[BibT_eX]

[DOI]

Oper. Res., 1984

Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization".

[BibT_eX]

[DOI]

Comb., 1984

1982

Scientific Program.

[BibT_eX]

[DOI]

Achim Bachem

Bernhard Korte

Proceedings of the Mathematical Programming The State of the Art, 1982

1981

Weakly bipartite graphs and the Max-cut problem.

[BibT_eX]

[DOI]

William R. Pulleyblank

Oper. Res. Lett., 1981

On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets.

[BibT_eX]

[DOI]

Discret. Math., 1981

The ellipsoid method and its consequences in combinatorial optimization.

[BibT_eX]

[DOI]

Comb., 1981

1980

On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets.

[BibT_eX]

[DOI]

Math. Oper. Res., 1980

Hypotraceable digraphs.

[BibT_eX]

[DOI]

Carsten Thomassen

J. Graph Theory, 1980

1979

On the symmetric travelling salesman problem II: Lifting theorems and facets.

[BibT_eX]

[DOI]

Manfred Padberg

Math. Program., 1979

On the symmetric travelling salesman problem I: Inequalities.

[BibT_eX]

[DOI]

Manfred Padberg

Math. Program., 1979

Buchbesprechungen.

[BibT_eX]

[DOI]

Z. Oper. Research, 1979

The graphs for which all strong orientations are hamiltonian.

[BibT_eX]

[DOI]

Frank Harary

J. Graph Theory, 1979

On minimal strong blocks.

[BibT_eX]

[DOI]

J. Graph Theory, 1979

1978

A property of continuous unbounded algorithms.

[BibT_eX]

[DOI]

Rabe von Randow

Math. Program., 1978

1977

Lineare Charakterisierungen von Travelling Salesman Problemen.

[BibT_eX]

[DOI]

Manfred W. Padberg

Math. Methods Oper. Res., 1977

1975

Partial linear characterizations of the asymmetric travelling salesman polytope.

[BibT_eX]

[DOI]