Improved Primal Simplex Algorithms for Shortest Path, Assignment and Minimum Cost Flow Problems: November, 1988 (Classic Reprint) - Softcover
Synopsis
A practical look at faster network optimization methods for flow and path problems.
This work presents a new primal scaling pivot rule for the network simplex algorithm and shows how it improves worst‑case performance for the minimum cost flow problem, with specialized results for the assignment and shortest path problems. It blends theory with concrete bounds and practical implementation ideas.
The approach centers on scaling the pivot rule to maintain strong feasibility and to reduce the number of pivots. By embedding scaling into Dantzig’s rule, the method achieves competitive running times and clearer performance guarantees across key combinatorial problems. The discussion covers data structures, complexity, and how the technique translates to specific problem settings.
- Introduction of a scaling network simplex pivot rule for flow problems
- Specialized results for the assignment and shortest path problems
- Analyses of pivot counts and running times with practical implementation notes
- Discussion of data structures and feasibility concepts to support efficient pivots
Ideal for readers seeking a solid, implementable approach to network optimization and its common applications.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Improved Primal Simplex Algorithms for Shortest Path,...
Seller Image
Improved Primal Simplex Algorithms for Shortest Path, Assignment and Minimum
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: New. Print on Demand. This book introduces a new and improved primal simplex pivot rule for the minimum cost flow problem, demonstrating its worst-case complexity and analyzing its implementation for the shortest path and assignment problems. The author expands on existing research and presents a detailed complexity analysis, providing valuable insights into the potential of this rule. This book positions itself as a significant contribution to the field of network optimization and is essential reading for researchers and practitioners interested in efficient algorithms for network flow problems. Its in-depth exploration of the scaling pivot rule and its applications make it an invaluable resource for advancing the theory and practice of network optimization. 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. Seller Inventory # 9781332265107_0
Buy New
US$ 17.27
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Improved Primal Simplex Algorithms for Shortest Path, Assignment and Minimum Cost Flow Problems November, 1988 Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332265107
Stock Image
Improved Primal Simplex Algorithms for Shortest Path, Assignment and Minimum Cost Flow Problems November, 1988 Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332265107
Buy New
US$ 23.75
US$ 4.41 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available
Stock Image
Improved Primal Simplex Algorithms for Shortest Path, Assignment and Minimum Cost Flow Problems : November, 1988 (Classic Reprint)
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar. Seller Inventory # 26075236/1
Buy Used
US$ 20.18
US$ 122.45 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available