Polynomial Dual Network Simplex Algorithms (Classic Reprint) - Softcover

James B. Orlin

 
9781332275106: Polynomial Dual Network Simplex Algorithms (Classic Reprint)

Synopsis

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.

"synopsis" may belong to another edition of this title.

Other Popular Editions of the Same Title