This is the second of a multi-volume set. The various volumes deal with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The emphasis is on late-1990s developments. Each chapter is essentially expository in nature, but scholarly in its treatment.
One area of mathematics which has come to the fore in recent years is that of Combinatorics. The intense interest has been fuelled in large part by the increasing importance...
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.
Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization.
Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified, comprehensive treatment of both graph theory and c
Handbook of Combinatorial Optimization
Handbook of combinatorial optimization & probability theory
This is the first book devoted entirely to Differential Evolution (DE) for global permutative-based combinatorial optimization.
This handbook provides an introduction to the state of the art of the probability theory that is most directly applicable to combinatorial optimization, with discrete optimization problems for points in Euclidean space, such as the minimum ...
Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization .
This book aims to demonstrate and detail the pervasive nature of Discrete Optimization. The handbook couples the difficult, critical-thinking aspects of mathematical modeling with the hot area of discrete optimization.