Michael Jünger Book order

This book honors Martin Grotschel: scientist, teacher and activist in mathematics, with chapters by collaborators, including his doctoral descendents, celebrating Grotschel's work in theory, applications and computation in combinatorial optimization.

50 Years of Integer Programming features talks and panel discussions from the Aussois workshop in 2008, commemorating the cutting-plane algorithm, which transformed the field. Key topics of integer programming are discussed by pioneers of the field.

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.

After an introduction to the subject area and a concise treatment of the technical foundations for the subsequent chapters, this book features 14 chapters on state-of-the-art graph drawing software systems, ranging from general "tool boxes'' to customized software for various applications. These chapters are written by leading they follow a uniform scheme and can be read independently from each other. The text covers many industrial applications.

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.