You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This is a carefully refereed collection of invited survey articles written by outstanding researchers. Aimed at researchers in discrete mathematics, operations research, and the theory of computing, this book offers an in-depth look at many topics not treated in textbooks.
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.
The editors and authors dedicate this book to Bernhard Korte on the occasion of his seventieth birthday. We, the editors, are happy about the overwhelming feedback to our initiative to honor him with this book and with a workshop in Bonn on November 3–7,2008.Althoughthiswouldbeareasontolookback,wewouldratherliketolook forward and see what are the interesting research directions today. This book is written by leading experts in combinatorial optimization. All - pers were carefully reviewed, and eventually twenty-three of the invited papers were accepted for this book. The breadth of topics is typical for the eld: combinatorial optimization builds bridges between areas like combinatorics and...
A practical, accessible guide to optimization problems with discrete or integer variables Integer Programming stands out from other textbooks by explaining in clear and simple terms how to construct custom-made algorithms or use existing commercial software to obtain optimal or near-optimal solutions for a variety of real-world problems, such as airline timetables, production line schedules, or electricity production on a regional or national scale. Incorporating recent developments that have made it possible to solve difficult optimization problems with greater accuracy, author Laurence A. Wolsey presents a number of state-of-the-art topics not covered in any other textbook. These include i...
Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list."-Optima "A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems."-Computing Rev...
Although modern location theory is now more than 90 years old, the focus of researchers in this area has been mainly problem oriented. However, a common theory, which keeps the essential characteristics of classical location models, is still missing. This monograph addresses this issue. A flexible location problem called the Ordered Median Problem (OMP) is introduced. For all three main subareas of location theory (continuous, network and discrete location) structural properties of the OMP are presented and solution approaches provided. Numerous illustrations and examples help the reader to become familiar with this new location model. By using OMP classical results of location theory can be reproved in a more general and sometimes even simpler way. Algorithms enable the reader to solve very flexible location models with a single implementation. In addition, the code of some algorithms is available for download.
This book is the only recent title to present polyhedral results and exact solution methods for location problems encountered in telecommunications, but which also have applications in other areas, such as transportation and supply chain management.
As the telecommunication industry introduces new sophisticated technologies, the nature of services and the volume of demands have changed. Indeed, a broad range of new services for users appear, combining voice, data, graphics, video, etc. This implies new planning issues. Fiber transmission systems that can carry large amounts of data on a few strands of wire were introduced. These systems have such a large bandwidth that the failure of even a single transmission link: in the network can create a severe service loss to customers. Therefore, a very high level of service reliability is becoming imperative for both system users and service providers. Since equipment failures and accidents can...
This edited book is compilation of studies conducted in the areas of technology and management. Contributors of this edited book articles are scholars from University Putra Malaysia, Taylors' University, INTI International College Subang, and University Malaysia Pahang. These cutting-edge articles will be of interest to researchers, and academics.
The application of modern methods in numerical mathematics on problems in chemical engineering is essential for designing, analyzing and running chemical processes and even entire plants. Scientific Computing in Chemical Engineering II gives the state of the art from the point of view of numerical mathematicians as well as that of engineers. The present volume as part of a two-volume edition covers topics such as computer-aided process design, combustion and flame, image processing, optimization, control, and neural networks. The volume is aimed at scientists, practitioners and graduate students in chemical engineering, industrial engineering and numerical mathematics.