TY  - BOOK
AU  - Nemhauser,George L.
AU  - Wolsey,Laurence A.
TI  - Integer and combinatorial optimization
T2  - Wiley-Interscience series in discrete mathematics and optimization
SN  - 047182819X
U1  - 519.77 22
PY  - 1999///
CY  - New York, Chichester
PB  - Wiley
KW  - Integer programming
KW  - Mathematical optimization
KW  - Combinatorial optimization
KW  - programmation en nombres entiers
KW  - optimisation combinatoire
KW  - fast
KW  - Otimização matemática
KW  - larpcal
KW  - Programação inteira e fluxos em rede
KW  - Optimisation combinatoire
KW  - ram
KW  - Optimisation mathématique
KW  - Programmation en nombres entiers
KW  - Informatique
KW  - Mathématiques
N1  - Includes bibliographical references (pages 721-747); pt. I. Foundations -- I.1. The Scope of Integer and Combinatorial Optimization -- I.2. Linear Programming -- I.3. Graphs and Networks -- I.4. Polyhedral Theory -- I.5. Computational Complexity -- I.6. Polynomial-Time Algorithms for Linear Programming -- I.7. Integer Lattices -- pt. II. General Integer Programming -- II. 1. The Theory of Valid Inequalities -- II. 2. Strong Valid Inequalities and Facets for Structured Integer Programs -- II. 3. Duality and Relaxation -- II. 4. General Algorithms -- II. 5. Special-Purpose Algorithms -- II. 6. Applications of Special-Purpose Algorithms -- pt. III. Combinatorial Optimization -- III. 1. Integral Polyhedra -- III. 2. Matching -- III. 3. Matroid and Submodular Function Optimization
ER  -