Integer and combinatorial optimization /
Collection : Wiley-Interscience series in discrete mathematics and optimization Publié par : Wiley, (New York ; | Chichester :) Détails physiques : xiv, 763 pages : illustrations ; 26 cm. ISBN :047182819X; 9780471828198; 0471359432; 9780471359432.Type de document | Site actuel | Cote | Statut | Date de retour prévue | Code à barres | Réservations |
---|---|---|---|---|---|---|
Livre | La bibliothèque des Sciences Exactes et Naturelles | 519.77 NEM (Parcourir l'étagère) | Disponible | 0000000026240 |
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.
Il n'y a pas de commentaire pour ce document.