Détail de l'auteur
Auteur Laurence A. Wolsey |
Documents disponibles écrits par cet auteur (1)



Titre : Integer and combinatorial optimization Type de document : texte imprimé Auteurs : George L. Nemhauser, Auteur ; Laurence A. Wolsey, Auteur Editeur : New York : John Wiley & Sons Année de publication : 1988 Collection : Wiley-interscience series in discrete mathematics and optimization Importance : XIV-763 p. Présentation : ill. Format : 26 cm ISBN/ISSN/EAN : 978-0-471-82819-8 Note générale : Bibliogr. p. 721-747. Index Langues : Anglais (eng) Mots-clés : Mathematical optimization
Integer programming
Combinatorial optimization
Optimisation combinatoire
Programmation en nombres entiers
Informatique -- MathématiquesIndex. décimale : 519.16 Problèmes algorithmiques de l'analyse combinatoire Résumé : Discrete mathematics, the study of finite structures, is one of the fastest-growing areas in mathematics. The wide applicability of its evolving techniques points to the rapidity with which the field is moving from its beginnings to its maturity, and reflects the ever-increasing interaction between discrete mathematics and computer science. This series provides broad coverage of discrete mathematics and optimization, ranging over such field as combinatorics, graph theory, enumeration, and the analysis of algorithms. Note de contenu : Contents:
* Foundations.
* General integer programming.
* Combinatorial optimization.Integer and combinatorial optimization [texte imprimé] / George L. Nemhauser, Auteur ; Laurence A. Wolsey, Auteur . - New York : John Wiley & Sons, 1988 . - XIV-763 p. : ill. ; 26 cm. - (Wiley-interscience series in discrete mathematics and optimization) .
ISBN : 978-0-471-82819-8
Bibliogr. p. 721-747. Index
Langues : Anglais (eng)
Mots-clés : Mathematical optimization
Integer programming
Combinatorial optimization
Optimisation combinatoire
Programmation en nombres entiers
Informatique -- MathématiquesIndex. décimale : 519.16 Problèmes algorithmiques de l'analyse combinatoire Résumé : Discrete mathematics, the study of finite structures, is one of the fastest-growing areas in mathematics. The wide applicability of its evolving techniques points to the rapidity with which the field is moving from its beginnings to its maturity, and reflects the ever-increasing interaction between discrete mathematics and computer science. This series provides broad coverage of discrete mathematics and optimization, ranging over such field as combinatorics, graph theory, enumeration, and the analysis of algorithms. Note de contenu : Contents:
* Foundations.
* General integer programming.
* Combinatorial optimization.Réservation
Réserver ce document
Exemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité Etat_Exemplaire 041214 519.16 NEM Papier Bibliothèque Centrale Mathématiques Disponible En bon état