Programmation linéaire, complexité : séparation et optimisation / Jean François Maurras
Type de document : MonographieCollection : Mathématiques et applications, 38Langue : français.Pays: Allemagne.Éditeur : Berlin : Springer, 2002Description : 1 vol. (XIV-221 p.) ; 25 cmISBN: 9783540436713.ISSN: 1154-483X.Bibliographie : Bibliogr. p. [213]-217. Index.Sujet MSC : 90Cxx, Operations research, mathematical programming - Mathematical programming90-01, Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming
90C25, Mathematical programming, Convex programming
90C60, Mathematical programming, Abstract computational complexity
Item type | Current library | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|
Monographie | CMI Salle 1 | Séries SMA (Browse shelf(Opens below)) | Available | 05219-01 |
This book introduces to the complexity analysis of algorithms, measured by the amount of time needed by an implementation on a Turing machine. This amount of time is expressed as a worst-case function of the size of the problem, which is the amount of memory needed for storing it. (Zentralblatt)
Bibliogr. p. [213]-217. Index
There are no comments on this title.