Integer and Combinatorial Optimization > 경영, 경제학/산업공학

Pt. I Foundations 1
I.1 The Scope of Integer and Combinatorial Optimization 3
I.2 Linear Programming 27
I.3 Graphs and Networks 50
I.4 Polyhedral Theory 83
I.5 Computational Complexity 114
I.6 Polynomial-Time Algorithms for Linear Programming 146
I.7 Integer Lattices 182
Pt. II General Integer Programming 203
II.1 The Theory of Valid Inequalities 205
II.2 Strong Valid Inequalities and Facets for Structured Integer Programs 259
II.3 Duality and Relaxation 296
II.4 General Algorithms 349
II.5 Special-Purpose Algorithms 383
II.6 Applications of Special-Purpose Algorithms 433
Pt. III Combinatorial Optimization 533
III.1 Integral Polyhedra 535
III.2 Matching 608
III.3 Matroid and Submodular Function Optimization 659
References 721
Author Index 749
Subject Index 755