Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice: 53 (International Series in Operations Research & Management Science, 53) - Tapa dura

Libro 42 de 323: International Series in Operations Research & Management Science

Bienstock, Daniel

 
9781402071737: Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice: 53 (International Series in Operations Research & Management Science, 53)
Tapa dura
ISBN 10: 1402071736 ISBN 13: 9781402071737
Editorial: Springer, 2002

Sinopsis

Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments.

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

Reseña del editor

Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments.

"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 
1402071736
ISBN 13 
9781402071737
Encuadernación
Tapa dura
Número de páginas
140
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

9781475776720: Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice: 53 (International Series in Operations Research & Management Science)

Edición Destacada

ISBN 10:  1475776721 ISBN 13:  9781475776720
Editorial: Springer, 2013
Tapa blanda