Genuinely Polynominal Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem (Classic Reprint) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Genuinely Polynominal Simplex and Non-Simplex Algorithms...
Seller Image
Genuinely Polynominal Simplex and Non-Simplex Algorithms for the Minimum Cost
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
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. Seller Inventory # 9781334017643_0
Buy New
£ 13.42
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Genuinely Polynominal Simplex and NonSimplex Algorithms for the Minimum Cost Flow Problem Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781334017643
Stock Image
Genuinely Polynominal Simplex and NonSimplex Algorithms for the Minimum Cost Flow Problem Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781334017643
Buy New
£ 17.35
£ 3.29 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available