Michael Jünger

Denis Naddef

This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.

Optimal or Provably Near-Optimal Solutions

Computational Combinatorial Optimization

This book is dedicated to Jack Edmonds in appreciation of his ground breaking work that laid the foundations for a broad variety of subsequent results achieved in combinatorial optimization. The main part consists of 13 revised full papers on current topics in combinatorial optimization, presented at Aussois 2001, the Fifth Aussois Workshop on Combinatorial Optimization, March 5-9, 2001, and dedicated to Jack Edmonds. Additional highlights in this book are an account of an Aussois 2001 special session dedicated to Jack Edmonds including a speech given by William R. Pulleyblank as well as newly typeset versions of three up-to-now hardly accessible classical papers: - Submodular Functions, Matroids, and Certain Polyhedra by Jack Edmonds - Matching: A Well-Solved Class of Integer Linear Programs by Jack Edmonds and Ellis L. Johnson - Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems by Jack Edmonds and Richard M. Karp.

Aussois 2001

Giovanni Rinaldi

Gerhard Reinelt

This book is dedicated to Jack Edmonds in appreciation of his ground breaking work that laid the foundations for a broad variety of subsequent results achieved in combinatorial optimization.The main part consists of 13 revised full papers on current topics in combinatorial optimization, presented at Aussois 2001, the Fifth Aussois Workshop on Combinatorial Optimization, March 5-9, 2001, and dedicated to Jack Edmonds.Additional highlights in this book are an account of an Aussois 2001 special session dedicated to Jack Edmonds including a speech given by William R. Pulleyblank as well as newly typeset versions of three up-to-now hardly accessible classical papers:- Submodular Functions, Matroids, and Certain Polyhedranbsp;nbsp; by Jack Edmonds- Matching: A Well-Solved Class of Integer Linear Programsnbsp;nbsp; by Jack Edmonds and Ellis L. Johnson- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problemsnbsp;nbsp; by Jack Edmonds and Richard M. Karp.

Papers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers

Combinatorial Optimization -- Eureka, You Shrink!

Daniel Schallmo

Thomas Werani

Andreas Rusnjak

Johanna Anzengruber

Dieses Buch zeigt wie es Unternehmen gelingt Ihre Geschäftsmodelle auf die Digitale Zukunft vorzubereiten und wie dadurch Wettbewerbsvorteile geschaffen und Kundenanforderungen besser erfüllt werden können. Die Autoren aus Praxis und Wissenschaft zeigen, wie die Digitale Transformation von Unternehmen über die gesamte Wertschöpfungskette hinweg gelingt. Die Beiträge behandeln Ansätze und Instrumente, Studienergebnisse und Best Practices unterschiedlicher Industrien im Kontext der Digitalen Transformation. Die Inhalte berücksichtigen divergierende Anforderungen von Unternehmen und Industrien und können nach Bedarf kombiniert und erweitert werden, um sie an die spezifischen Rahmenbedingungen eines Unternehmens anzupassen.

Grundlagen, Instrumente und Best Practices

Digitale Transformation von Geschäftsmodellen

Laurence A. Wolsey

George L. Nemhauser

William R. Pulleyblank

Thomas M. Liebling

In 1958, Ralph E. Gomory transformed the field of integer programming when he published a paper that described a cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In 2008, to commemorate the anniversary of this seminal paper, a special workshop celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. It contains reprints of key historical articles and written versions of survey lectures on six of the hottest topics in the field by distinguished members of the integer programming community. Useful for anyone in mathematics, computer science and operations research, this book exposes mathematical optimization, specifically integer programming and combinatorial optimization, to a broad audience.

From the Early Years to the State-of-the-Art

50 Years of Integer Programming 1958-2008

Volker Kaibel

This book constitutes the refereed proceedings of the 11th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2005, held in Berlin, Germany in June 2005. The 34 revised full papers presented were carefully reviewed and selected from 119 submissions. Among the topics addressed are mixed-integer programming, graph theory, graph algorithms, approximation, linear programming, approximability, packing, scheduling, computational geometry, randomization, network algorithms, sequencing, TSP, and travelling salesman problem.

11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings

Integer Programming and Combinatorial Optimization

Martin Grötschel is one of the most influential mathematicians of our time. He has received numerous honors and holds a number of key positions in the international mathematical community. He celebrated his 65th birthday on September 10, 2013. Martin Grötschel’s doctoral descendant tree 1983–2012, i.e., the first 30 years, features 39 children, 74 grandchildren, 24 great-grandchildren and 2 great-great-grandchildren, a total of 139 doctoral descendants. This book starts with a personal tribute to Martin Grötschel by the editors (Part I), a contribution by his very special “predecessor” Manfred Padberg on “Facets and Rank of Integer Polyhedra” (Part II), and the doctoral descendant tree 1983–2012 (Part III). The core of this book (Part IV) contains 16 contributions, each of which is coauthored by at least one doctoral descendant. The sequence of the articles starts with contributions to the theory of mathematical optimization, including polyhedral combinatorics, extended formulations, mixed-integer convex optimization, super classes of perfect graphs, efficient algorithms for subtree-telecenters, junctions in acyclic graphs and preemptive restricted strip covering, as well as efficient approximation of non-preemptive restricted strip covering. Combinations of new theoretical insights with algorithms and experiments deal with network design problems, combinatorial optimization problems with submodular objective functions and more general mixed-integer nonlinear optimization problems. Applications include VLSI layout design, systems biology, wireless network design, mean-risk optimization and gas network optimization. Computational studies include a semidefinite branch and cut approach for the max k-cut problem, mixed-integer nonlinear optimal control, and mixed-integer linear optimization for scheduling and routing of fly-in safari planes. The two closing articles are devoted to computational advances in general mixed integer linear optimization, the first by scientists working in industry, the second by scientists working in academia. These articles reflect the “scientific facets” of Martin Grötschel who has set standards in theory, computation and applications.

Festschrift for Martin Grötschel

Facets of Combinatorial Optimization

Petra Mutzel

Sebastian Leipert

This book constitutes the thoroughly refereed post-proceedings of the 9th International Symposium on Graph Drawing, GD 2001, held in Vienna, Austria, in September 2001.The 32 revised full papers presented were carefully reviewed and selected from 66 paper submissions. Also included are a corrected version of a paper from the predecessor volume, short reports on the software systems exhibition, two papers of the special session on graph exchange formats, and a report on the annual graph drawing contests. The papers are organized in topical sections on hierarchical drawing, planarity, crossing theory, compaction, planar graphs, symmetries, interactive drawing, representations, aesthetics, 2D- and 3D-embeddings, data visualization, floor planning, and planar drawing.

9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers

Graph Drawing

Achim Bachem

Ulrich Derigs

Rainer Schrader

This proceedings volume contains extended abstracts of talks presented at the 18th Symposium on Operations Research held at the University of Cologne, September 1-3, 1993. The Symposia on Operations Research are the annual meetings of the Gesellschaft fiir Mathematik, Okonometrie und Operations Research (GMOOR), a scientific society providing a link between research and applications in the areas of applied mathematics, economics and operations research. The broad range of interests and scientific activities covered by GMOOR and its members was demonstrated by about 250 talks presented at the 18th Symposium. As in l'ecent years, emphasis was placed on optimization and stochastics, this year with a special focus on combinatorial optimization and discrete mathematics. We appreciate that with sections on parallel and distributed computing and on scientific computing also new fields could be integrated into the scope of the GMOOR. This book contains extended abstracts of most of the papers presented at the con ference. Long versions and full papers of the talks are expected to appear elsewhere in refereed periodicals. The contributions were divided into sixteen sections: (1) Theory of Optimization, (2) Computational Methods of Optimization, (3) Combinatorial Optimization and Dis crete Mathematics, (4) Scientific Computing, (5) Decision Theory, (6) Mathematical Economics and Game Theory, (7) Banking, Finance and Insurance, (8) Econometrics, (9) Macroeconomics and Economic Theory, (10) Stochastics, (11) Production and Lo gistics, (12) System and Control Theory, (13) Routing and Scheduling, (14) Knowledge Based Systems, (15) Information Systems and (16) Parallel and Distributed Compu ting.

Extended Abstracts of the 18th Symposium on Operations Research held at the University of Cologne September 1–3, 1993

Operations Research ’93

Symposium on Graph Drawing (9 : 2001 : Vienna)

Austria) Symposium on Graph Drawing 2001 (Vienna

This book constitutes the thoroughly refereed post-proceedings of the 9th International Symposium on Graph Drawing, GD 2001, held in Vienna, Austria, in September 2001. The 32 revised full papers presented were carefully reviewed and selected from 66 paper submissions. Also included are a corrected version of a paper from the predecessor volume, short reports on the software systems exhibition, two papers of the special session on graph exchange formats, and a report on the annual graph drawing contests. The papers are organized in topical sections on hierarchical drawing, planarity, crossing theory, compaction, planar graphs, symmetries, interactive drawing, representations, aesthetics, 2D- and 3D-embeddings, data visualization, floor planning, and planar drawing.

Michael Jünger

Books

Your next favorite book is out there