Foundations; The scope of integer and combinatorial optimization; Linear programming; Graphs and networks; Polyhedral theory; Computational complexity; Polynomial-time algorithms for linear programming; Integer lattices; General integer programming; The theory of valid inequalit…
"This book describes in-depth the five main iterative algorithms for solving hard combinatorial optimization problems: Simulated Annealing, Genetic Algorithms, Tabu Search, Simulated Evolution, and Stochastic Evolution. The authors present various iterative techniques and illust…
Graphs and networks; The shortest directed path problem; Maximum flows in networks; Minimum trees and communication nets; Feasibility theorems and their applications; Applications of flow theorems to subgraph problems; Index.
