INTEGER AND COMBINATORIAL OPTIMIZATION (Broché)

Laurence-A Wolsey, George-L Nemhauser

Note moyenne : | 0 avis
Ce produit n'a pas encore été évalué. Soyez le premier !
  • Wiley

  • Paru le : 06/10/1999
  • 1 million de livres à découvrir
  • Livraison à domicile à partir de 0,01 €
  • Paiement sécurisé, débit à l'expédition
95,10 €
Neuf - Expédié sous 8 à 14 jours
Livré chez vous entre le 16 décembre et le 22 décembre
ou
Votre note
"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
  • 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 Inequalities
    • Strong Valid Inequalities and Facets for Structured Integer Programs
    • Duality and Relaxation
    • General Algorithms
    • Special-Purpose Algorithms
    • Applications of Special-Purpose Algorithms
  • COMBINATORIAL OPTIMIZATION
    • Integral Polyhedra
    • Matching
    • Matroid and Submodular Function Optimization.
  • Date de parution : 06/10/1999
  • Editeur : Wiley
  • Collection : discrete mathematics optimizat
  • ISBN : 0-471-35943-2
  • EAN : 9780471359432
  • Présentation : Broché
  • Nb. de pages : 763 pages
  • Poids : 1.37 Kg
  • Dimensions : 17,9 cm × 25,3 cm × 3,6 cm

Nos avis clients sur decitre.fr


Avis Trustpilot

INTEGER AND COMBINATORIAL OPTIMIZATION est également présent dans les rayons

Laurence-A Wolsey et George-L Nemhauser - .
INTEGER AND COMBINATORIAL OPTIMIZATION
95,10 €
Haut de page
Decitre utilise des cookies pour vous offrir le meilleur service possible. En continuant votre navigation, vous en acceptez l'utilisation. En savoir plus OK

Ne partez pas tout de suite...

Inscription newsletter