Algorithmic Principles of Mathematical Programming: 24 (Texts in the Mathematical Sciences, 24) - Tapa dura

Still, Georg; ULRICH FAIGLE; Kern, W.

 
9781402008528: Algorithmic Principles of Mathematical Programming: 24 (Texts in the Mathematical Sciences, 24)
Tapa dura
ISBN 10: 140200852X ISBN 13: 9781402008528
Editorial: Springer, 2002

Sinopsis

Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems. Recent advances in algorithmic theory have shown that the traditionally separate areas of discrete optimization, linear programming, and nonlinear optimization are closely linked. This book offers a comprehensive introduction to the whole subject and leads the reader to the frontiers of current research. The prerequisites to use the book are very elementary. All the tools from numerical linear algebra and calculus are fully reviewed and developed. Rather than attempting to be encyclopedic, the book illustrates the important basic techniques with typical problems. The focus is on efficient algorithms with respect to practical usefulness. Algorithmic complexity theory is presented with the goal of helping the reader understand the concepts without having to become a theoretical specialist. Further theory is outlined and supplemented with pointers to the relevant literature.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems. Recent advances in algorithmic theory have shown that the traditionally separate areas of discrete optimization, linear programming, and nonlinear optimization are closely linked. This book offers a comprehensive introduction to the whole subject and leads the reader to the frontiers of current research. The prerequisites to use the book are very elementary. All the tools from numerical linear algebra and calculus are fully reviewed and developed. Rather than attempting to be encyclopedic, the book illustrates the important basic techniques with typical problems. The focus is on efficient algorithms with respect to practical usefulness. Algorithmic complexity theory is presented with the goal of helping the reader understand the concepts without having to become a theoretical specialist. Further theory is outlined and supplemented with pointers to the relevant literature.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2002
Idioma
Inglés
ISBN 10 
140200852X
ISBN 13 
9781402008528
Encuadernación
Tapa dura
Número de páginas
356
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Otras ediciones populares con el mismo título

9789048161171: Algorithmic Principles of Mathematical Programming: 24 (Texts in the Mathematical Sciences)

Edición Destacada

ISBN 10:  9048161177 ISBN 13:  9789048161171
Editorial: Springer, 2010
Tapa blanda