Isbn: 9781332265107 - improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems: november, 1988 (classic reprint) (4 risultati)

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condizione: 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.…

Condizione: Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.