Integer and Combinatorial OptimizationRave 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 Reviews "[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners."-Mathematical Reviews "This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization."-Bulletin of the London Mathematical Society "This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments."-Times Higher Education Supplement, London Also of interest . . . INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively. 1998 (0-471-28366-5) 260 pp. |
Contents
Remarks on 01 and PureInteger Programming | 125 |
The Class | 131 |
Complexity and Polyhedra | 139 |
Copyright | |
8 other sections not shown
Other editions - View all
Common terms and phrases
2-matching a₁ augmenting path b₁ branch-and-bound c₁ column combinatorial optimization consider constraints contains convex hull Corollary d₁ d₂ digraph dual feasible dual solution duality edges Example extreme points feasibility problem feasible solution finite formulation given graph G greedy greedy algorithm greedy heuristic Hence heuristic incidence matrix integer programming Iteration j₁ knapsack problem Lagrangian linear programming relaxation matching matroid max{cx minimum-weight node packing nondecreasing nonnegative NP-complete NP-hard obtain optimal solution perfect graphs polyhedra polyhedron polynomial polynomial-time algorithm polytope programming problem Proof Proposition pseudonode satisfies Section shown in Figure simplex algorithm solve Step subgraph submodular subset subtour superadditive Suppose Theorem traveling salesman problem tree upper bound V₁ valid inequality variables vector weight x₁ y₁ yields Σ Σ