Genuinely Polynominal Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem (Classic Reprint) - Tapa blanda
Sinopsis
Explore how this book reframes the minimum cost flow problem with genuinely polynomial algorithms. It presents new dual simplex approaches and connects them to practical network optimization, offering a clear path from classic methods to modern bounds.
Two concise sections outline the scope and value: first, a historical view of Edmonds–Karp scaling and the search for polynomial-time pivot rules; second, a detailed development of two network dual simplex algorithms with provable performance guarantees. The discussion stays focused on structure, complexity, and implementation insights that matter for researchers and practitioners alike.
- Two genuinely polynomial dual simplex pivot rules for minimum cost flow
- Connections between dual pivots and shortest-path steps, including Dijkstra-based interpretations
- Complexity bounds that compare with Edmonds–Karp scaling and other classical methods
- Guidance on implementing these algorithms for sparse networks and practical use
Ideal for readers of advanced optimization, operations research, and algorithm design who want a rigorous but accessible treatment of network flow methods.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
Excerpt from Genuinely Polynominal Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem
This first question is motivated in part by the existance of genuinely polynomial algorithms for several important subclasses of network flow problems, viz., the assignment problem, the shortest path problem, and the maximum flow problem.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sobre este título" puede pertenecer a otra edición de este libro.
Otras ediciones populares con el mismo título
Resultados de la búsqueda para Genuinely Polynominal Simplex and Non-Simplex Algorithms...
Imagen del vendedor
Genuinely Polynominal Simplex and Non-Simplex Algorithms for the Minimum Cost
Impresión bajo demandaLibrería: Forgotten Books, London, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: 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. Nº de ref. del artículo: 9781334017643_0
Comprar nuevo
EUR 15,23
Gastos de envío gratis
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Genuinely Polynominal Simplex and NonSimplex Algorithms for the Minimum Cost Flow Problem Classic Reprint
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781334017643
Comprar nuevo
EUR 21,35
Gastos de envío gratis
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 15 disponibles
Imagen de archivo
Genuinely Polynominal Simplex and NonSimplex Algorithms for the Minimum Cost Flow Problem Classic Reprint
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781334017643
Comprar nuevo
EUR 20,66
Envío por EUR 3,80
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: 15 disponibles