.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Potential Function Methods for Approximately Solving Linear Programming Problems
Daniel Bienstock
€ 130.28
FREE Delivery in Ireland
Description for Potential Function Methods for Approximately Solving Linear Programming Problems
Hardback. Focusing on linear programming theory, this book draws on the research developments in three areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. Series: International Series in Operations Research & Management Science. Num Pages: 130 pages, biography. BIC Classification: PBUH; TGP. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 9. Weight in Grams: 830.
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 ... Read more
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 ... Read more
Product Details
Format
Hardback
Publication date
2002
Publisher
Kluwer Academic Publishers United States
Number of pages
130
Condition
New
Series
International Series in Operations Research & Management Science
Number of Pages
111
Place of Publication
New York, NY, United States
ISBN
9781402071737
SKU
V9781402071737
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Potential Function Methods for Approximately Solving Linear Programming Problems