Ronald L. Graham

Martin Grötschel

László Lovász

Laszlo Lovasz

Laszla3

L?szl?

Basic Graph Theory: Paths and Circuits J. A. Bondy2.

Handbook of Combinatorics

Sven O. Krumke

Joerg Rambau

In its thousands of years of history, mathematics has made an extraordinary ca reer. It started from rules for bookkeeping and computation of areas to become the language of science. Its potential for decision support was fully recognized in the twentieth century only, vitally aided by the evolution of computing and communi cation technology. Mathematical optimization, in particular, has developed into a powerful machinery to help planners. Whether costs are to be reduced, profits to be maximized, or scarce resources to be used wisely, optimization methods are available to guide decision making. Opti mization is particularly strong if precise models of real phenomena and data of high quality are at hand - often yielding reliable automated control and decision proce dures. But what, if the models are soft and not all data are around? Can mathematics help as well? This book addresses such issues, e. g. , problems of the following type: - An elevator cannot know all transportation requests in advance. In which order should it serve the passengers? - Wing profiles of aircrafts influence the fuel consumption. Is it possible to con tinuously adapt the shape of a wing during the flight under rapidly changing conditions? - Robots are designed to accomplish specific tasks as efficiently as possible. But what if a robot navigates in an unknown environment? - Energy demand changes quickly and is not easily predictable over time. Some types of power plants can only react slowly.

Online Optimization of Large Scale Systems

Handbook of Combinatorics, Volume 1 focuses on basic methods, paradigms, results, issues, and trends across the broad spectrum of combinatorics. The selection first elaborates on the basic graph theory, connectivity and network flows, and matchings and extensions. Discussions focus on stable sets and claw free graphs, nonbipartite matching, multicommodity flows and disjoint paths, minimum cost circulations and flows, special proof techniques for paths and circuits, and Hamilton paths and circuits in digraphs. The manuscript then examines coloring, stable sets, and perfect graphs and embeddings and minors. The book takes a look at random graphs, hypergraphs, partially ordered sets, and matroids. Topics include geometric lattices, structural properties, linear extensions and correlation, dimension and posets of bounded degree, hypergraphs and set systems, stability, transversals, and matchings, and phase transition. The manuscript also reviews the combinatorial number theory, point lattices, convex polytopes and related complexes, and extremal problems in combinatorial geometry. The selection is a valuable reference for researchers interested in combinatorics.

Handbook of Combinatorics Volume 1

Gyula O.H. Katona

This collection of articles offers an excellent view on the state of combinatorics and related topics. A number of friends and colleagues, all top authorities in their fields of expertise have contributed their latest research papers to this volume.

Between Mathematics and Computer Science

Building Bridges

Alexander Schrijver

Historically, there is a close connection between geometry and optImization. This is illustrated by methods like the gradient method and the simplex method, which are associated with clear geometric pictures. In combinatorial optimization, however, many of the strongest and most frequently used algorithms are based on the discrete structure of the problems: the greedy algorithm, shortest path and alternating path methods, branch-and-bound, etc. In the last several years geometric methods, in particular polyhedral combinatorics, have played a more and more profound role in combinatorial optimization as well. Our book discusses two recent geometric algorithms that have turned out to have particularly interesting consequences in combinatorial optimization, at least from a theoretical point of view. These algorithms are able to utilize the rich body of results in polyhedral combinatorics. The first of these algorithms is the ellipsoid method, developed for nonlinear programming by N. Z. Shor, D. B. Yudin, and A. S. NemirovskiI. It was a great surprise when L. G. Khachiyan showed that this method can be adapted to solve linear programs in polynomial time, thus solving an important open theoretical problem. While the ellipsoid method has not proved to be competitive with the simplex method in practice, it does have some features which make it particularly suited for the purposes of combinatorial optimization. The second algorithm we discuss finds its roots in the classical "geometry of numbers", developed by Minkowski. This method has had traditionally deep applications in number theory, in particular in diophantine approximation.

Geometric Algorithms and Combinatorial Optimization

Volker Mehrmann

Klaus Lucas

Mathematik trägt immer stärker zur Produktentwicklung und Produktionssicherheit, zur Wertschöpfung und Ressourcenschonung bei. Das Buch erörtert in verschiedenen ingenieurwissenschaftlichen Themenfeldern das Verhältnis von Mathematik und Technikwissenschaften, den Beitrag der Mathematik zur industriellen Wertschöpfung und die Schlüsselrolle der Mathematik bei der Beherrschung komplexer Systeme. Gleichzeitig schlagen die Autoren Maßnahmen zur Verbesserung der Interaktion zwischen Mathematik und Technikwissenschaften, Forschung und Industrie vor.

Produktionsfaktor Mathematik

Mathematics as a production factor or driving force for innovation? Those, who want to know and understand why mathematics is deeply involved in the design of products, the layout of production processes and supply chains will find this book an indispensable and rich source. Describing the interplay between mathematical and engineering sciences the book focusses on questions like How can mathematics improve to the improvement of technological processes and products? What is happening already? Where are the deficits? What can we expect for the future? 19 articles written by mixed teams of authors of engineering, industry and mathematics offer a fascinating insight of the interaction between mathematics and engineering.

Production Factor Mathematics

Dietmar Hömberg

Peter Deuflhard

Mathematics: intellectual endeavor, production factor, key technology, key to key technologies? Mathematics is all of these; the last three of its facets are not well known, though. They have been the focus of the research and development in the Berlin-based DFG Research Center MATHEON in the last twelve years. Through these activities, MATHEON has become an international trademark. Its mission and its strategies for carrying out creative, application-driven research in mathematics and cooperating in the solution of complex problems in key technologies are by now a role model for the development of many other centers. Modern key technologies have become highly sophisticated, integrating aspects of engineering, computer, business and other sciences. At the same time, the innovation cycles get shorter and shorter. These simultaneous challenges can be mastered only by qualitatively and quantitatively rigorous methods. And that is where mathematics is indispensable. Flexible mathematical models, as well as fast and accurate methods for numerical simulation and optimization, open new possibilities to handle the indicated complexities, to react quickly, and to explore new options. Researchers in mathematical fields such as optimization, discrete mathematics, numerical analysis, scientific computing, applied analysis and stochastic analysis have to work hand in hand with scientists and engineers to fully exploit this potential and to strengthen the transversal role of mathematics in solving the challenging problems in key technologies. This book presents in seven chapters the research highlights of the research work carried out in the MATHEON application areas: Life Sciences, Networks, Production, Electronic and Photonic Devices, Finance, Visualization, and Education. The chapters summarize many of the contributions, put them in the context of current mathematical research activities, and outline their impact in various key technologies. To make some of the results more easily accessible to the general public, a large number of ``showcases'' are presented that illustrate a few success stories.

Mathematics for Key Technologies

MATHEON

Discrete mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is László Lovász, a scholar whose outstanding scientific work has defined and shaped many research directions in the last 40 years. A number of friends and colleagues, all top authorities in their fields of expertise and all invited plenary speakers at one of two conferences in August 2008 in Hungary, both celebrating Lovász’s 60th birthday, have contributed their latest research papers to this volume. This collection of articles offers an excellent view on the state of combinatorics and related topics and will be of interest for experienced specialists as well as young researchers.

Martin Grötschel

About

Books

Join the club