Articoli correlati a Polynomial Dual Network Simplex Algorithms (Classic...
Sinossi
Excerpt from Polynomial Dual Network Simplex Algorithms
The transshipment problem is one of the central problems in network optimization. There exist several polynomial and strongly polynomial algorithms for solving this problem (see the surveys Nevertheless, the method of choice in practice still seems to be the network simplex method.
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 18,55
EUR 1,91 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per Polynomial Dual Network Simplex Algorithms (Classic...
Foto dell'editore
Polynomial Dual Network Simplex Algorithms Classic Reprint
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332275106
Quantità: 15 disponibili
Foto dell'editore
Polynomial Dual Network Simplex Algorithms Classic Reprint
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332275106
Quantità: 15 disponibili
Immagini fornite dal venditore
Polynomial Dual Network Simplex Algorithms (Classic Reprint)
Print on DemandDa: Forgotten Books, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: New. Print on Demand. This book presents polynomial and strongly polynomial algorithms for the transshipment problem, which is central to network optimization. The author shows how to use excess scaling algorithms to guide pivot selection for both capacitated and uncapacitated transshipment problems, resulting in a polynomial simplex algorithm with a bounded number of pivots. The author also presents a strongly polynomial version of the algorithm with a strongly polynomial bound on the number of pivots. The insights presented in this book advance the field of network optimization by providing efficient algorithms for solving the transshipment problem. 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. Codice articolo 9781332275106_0
Quantità: Più di 20 disponibili