Genuinely Polynominal Simplex Non Simplex by Orlin James (3 results)

- Hardcover
Seller: PBShop.store US, Wood Dale, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
£ 24.51
Free ShippingShips within U.S.A.Quantity: 15 available
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.

- Hardcover
Seller: PBShop.store UK, Fairford, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
£ 22.27
£ 4.16 shippingShips from United Kingdom to U.S.A.Quantity: 15 available
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
More images- Softcover
- Print on Demand
Seller: Forgotten Books, London, United KingdomForgotten Books
Contact seller4-star sellerCondition: New
£ 13.36
Free ShippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: New. Print on Demand. This book presents two efficient, polynomial-time algorithms for solving minimum cost network flow problems, a prevalent problem in network optimization with applications in areas such as logistics and telecommunications. The first algorithm, a modification of the Edmonds-Karp scaling…technique, is genuinely polynomial, meaning the number of arithmetic operations it takes to find a solution is independent of the size of the input data. The second algorithm is a dual simplex algorithm that is also genuinely polynomial and may be implemented to run in time proportional to the Edmonds-Karp scaling technique. This book makes several contributions to the field of network optimization, including a new theoretical framework for analyzing the efficiency of minimum cost network flow algorithms and the development of new algorithms that are both theoretically and practically efficient. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.