Name: Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice (en Inglés)
Price: 320.36 PEN
Availability: InStock
Author: Bienstock, Daniel
ISBN: 9781475776720

portada Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice (en Inglés)

Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice (en Inglés)

Formato

Libro Físico

Autor

Daniel Bienstock

Editorial

Springer

Idioma

Inglés

N° páginas

111

Encuadernación

Tapa Blanda

Dimensiones

23.4 x 15.6 x 0.7 cm

Peso

0.20 kg.

ISBN13

9781475776720

Categorías

Medicina: cuestiones generales
Programación lineal
Programación informática/desarrollo de software

Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice (en Inglés)

Daniel Bienstock (Autor) · Springer · Tapa Blanda

Libro Nuevo Importado

Envío: 13 a 18 días háb.

S/ 711,91S/ 320,36

-55%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

S/ 320,36

Llega entre el 15 Jul y el 24 Jul a CERCADO DE LIMA, Lima. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice (en Inglés)"

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.