Polynomial Dual Network Simplex Algorithms (Classic Reprint)

Excerpt from Polynomial Dual Network Simplex AlgorithmsThe 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 PublisherForgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.comThis 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.