Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The second edition of this 5-volume handbook is intended to be a basic yet comprehensive reference work in combinatorial optimization that will benefit newcomers and researchers for years to come. This multi-volume work deals with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The editors have brought together almost every aspect of this enormous field of combinatorial optimization, an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communications networks, and management science. An international team of 30-40 experts in the field form the editorial board. The Handbook of Combinatorial Optimization, second edition is addressed to all scientists who use combinatorial optimization methods to model and solve problems. Experts in the field as well as non-specialists will find the material stimulating and useful.

Combinatorial optimization --- Civil & Environmental Engineering --- Engineering & Applied Sciences --- Operations Research --- Optimization, Combinatorial --- Mathematics. --- Mathematical optimization. --- Combinatorics. --- Optimization. --- Combinatorics --- Algebra --- Mathematical analysis --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Maxima and minima --- Operations research --- Simulation methods --- System analysis

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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, superclasses 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.

Numerical methods of optimisation --- Operational research. Game theory --- Discrete mathematics --- Mathematics --- Planning (firm) --- Computer science --- Computer. Automation --- toegepaste wiskunde --- draadloze computernetwerken --- complexiteit --- discrete wiskunde --- automatisering --- informatica --- mathematische modellen --- wiskunde --- algoritmen --- Combinatorial optimization.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Due to an ever-decreasing supply in raw materials and stringent constraints on conventional energy sources, demand for lightweight, efficient and low-cost structures has become crucially important in modern engineering design. This requires engineers to search for optimal and robust design options to address design problems that are commonly large in scale and highly nonlinear, making finding solutions challenging. In the past two decades, metaheuristic algorithms have shown promising power, efficiency and versatility in solving these difficult optimization problems. This book examin

Cluster analysis. --- Combinatorial optimization. --- Data mining. --- Heuristic programming. --- Production management -- Data processing. --- Engineering design --- Engineering --- Heuristic algorithms --- Engineering & Applied Sciences --- Business & Economics --- Economic History --- Applied Mathematics --- Mathematical models --- Statistical methods --- Infrastructure (Economics) --- Capital, Social (Economics) --- Economic infrastructure --- Social capital (Economics) --- Social infrastructure --- Social overhead capital --- Economic development --- Human settlements --- Public goods --- Public works --- Capital --- Heuristic algorithms. --- Mathematical models. --- Statistical methods.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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, superclasses 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.

Combinatorial optimization. --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- Mathematical optimization. --- Mathematics. --- Algorithms. --- Computational complexity. --- Optimization. --- Applications of Mathematics. --- Mathematical Modeling and Industrial Mathematics. --- Discrete Mathematics in Computer Science. --- Complexity, Computational --- Electronic data processing --- Machine theory --- Algorism --- Algebra --- Arithmetic --- Math --- Science --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Foundations --- Applied mathematics. --- Engineering mathematics. --- Mathematical models. --- Computer science—Mathematics. --- Models, Mathematical --- Engineering --- Engineering analysis --- Mathematics --- Grötschel, Martin. --- Grötschel, M. --- Groetschel, Martin

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book is an updated effort in summarizing the trending topics and new hot research lines in solving dynamic problems using metaheuristics. An analysis of the present state in solving complex problems quickly draws a clear picture: problems that change in time, having noise and uncertainties in their definition are becoming very important. The tools to face these problems are still to be built, since existing techniques are either slow or inefficient in tracking the many global optima that those problems are presenting to the solver technique. Thus, this book is devoted to include several of the most important advances in solving dynamic problems. Metaheuristics are the more popular tools to this end, and then we can find in the book how to best use genetic algorithms, particle swarm, ant colonies, immune systems, variable neighborhood search, and many other bioinspired techniques. Also, neural network solutions are considered in this book. Both, theory and practice have been addressed in the chapters of the book. Mathematical background and methodological tools in solving this new class of problems and applications are included. From the applications point of view, not just academic benchmarks are dealt with, but also real world applications in logistics and bioinformatics are discussed here. The book then covers theory and practice, as well as discrete versus continuous dynamic optimization, in the aim of creating a fresh and comprehensive volume. This book is targeted to either beginners and experienced practitioners in dynamic  optimization, since we took care of devising the chapters in a way that a wide audience could profit from its contents. We hope to offer a single source for up-to-date information in dynamic optimization, an inspiring and attractive new research domain that appeared in these last years and is here to stay.

Engineering & Applied Sciences --- Computer Science --- Combinatorial optimization. --- Computer algorithms. --- Computational intelligence. --- Intelligence, Computational --- Optimization, Combinatorial --- Engineering. --- Artificial intelligence. --- Computational Intelligence. --- Artificial Intelligence (incl. Robotics). --- Artificial intelligence --- Soft computing --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Construction --- Industrial arts --- Technology --- Algorithms --- Combinatorial analysis --- Mathematical optimization --- Artificial Intelligence.