Verwandte Artikel zu Polynomial Dual Network Simplex Algorithms (Classic...
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 18,54
EUR 0,80 für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Polynomial Dual Network Simplex Algorithms (Classic...
Beispielbild für diese ISBN
Polynomial Dual Network Simplex Algorithms Classic Reprint
Anbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332275106
Anzahl: 15 verfügbar
Beispielbild für diese ISBN
Polynomial Dual Network Simplex Algorithms Classic Reprint
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332275106
Anzahl: 15 verfügbar
Foto des Verkäufers
Polynomial Dual Network Simplex Algorithms (Classic Reprint)
Print-on-DemandAnbieter: Forgotten Books, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9781332275106_0
Anzahl: Mehr als 20 verfügbar