Order Total (1 Item Items):
Shipping Destination:
James B Orlin (67 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (67)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (54)
- As New, Fine or Near Fine (9)
- Very Good or Good (4)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (34)
- Not Print on Demand (41)
Language (3)
Free Shipping
Seller Location
Seller Rating
-
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
Flows in Networks (Princeton Landmarks in Mathematics and Physics)
Language: English
Published by Princeton University Press, 2010
ISBN 10: 0691146675 ISBN 13: 9780691146676
Seller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. 216 pp., Paperback, NEW!! - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.
-
Polynomial Dual Network Simplex Algorithms 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.
-
Genuinely Polynominal Simplex and NonSimplex Algorithms for the Minimum Cost Flow Problem 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.
-
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
Condition: As New. Unread book in perfect condition.
-
Condition: As New. Unread book in perfect condition.
-
Condition: New.
-
Flows in Networks
Language: English
Published by Princeton University Press, 2024
ISBN 10: 069127343X ISBN 13: 9780691273433
Condition: New.
-
Condition: New.
-
Genuinely Polynominal Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem (Classic Reprint)
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
Flows in Networks
Language: English
Published by Princeton University Press, 2024
ISBN 10: 069127343X ISBN 13: 9780691273433
Condition: As New. Unread book in perfect condition.
-
Polynomial Dual Network Simplex Algorithms
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
Network Flows
Language: German
Published by Massachusetts: Sloan School of Management, 1988
ISBN 10: 1179434307 ISBN 13: 9781179434308
Seller: avelibro OHG, Dinkelscherben, Germany
Association Member: BOEV
Seller rating 5 out of 5 stars
4°, Softcover/Paperback. Condition: Gut. 209 S. Ausgetragenes Bibliotheksexemplar mit den üblichen Kennzeichnungen und Stempeln. An den Ecken leicht bestoßen, einzelne Gebrauchsspuren am Einband. Innen sauber und in gutem Zustand. B09-11-03E Sprache: Deutsch Gewicht in Gramm: 440.
-
Analysis Of Path-Based Approaches To Genomic Physical Mapping
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
Analysis Of Path-Based Approaches To Genomic Physical Mapping
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Polynomial Dual Network Simplex Algorithms
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Flows in Networks
Language: English
Published by Princeton University Press, 2024
ISBN 10: 069127343X ISBN 13: 9780691273433
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Flows in Networks
Language: English
Published by Princeton University Press, 2024
ISBN 10: 069127343X ISBN 13: 9780691273433
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
Paperback. Condition: New. Print on Demand. This book presents a new approach to improving the efficiency of the maximum flow problem, a cornerstone of network flow theory with wide-ranging applications in computer science, operations research, and other disciplines. The author extends and refines existing preflow algorithms to obtain asymptotically faster running times for the problem. The book offers a detailed analysis of these improved algorithms, showing how they achieve their speedup and providing insights into the behavior of network flow algorithms in general. It concludes by introducing dynamic trees, a sophisticated data structure, into the mix to further enhance efficiency, resulting in the fastest known algorithm for the maximum flow problem at the time of writing. 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.
-
Paperback. Condition: New. Print on Demand. 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.
-
Paperback. Condition: New. Print on Demand. This book introduces Single Transferable Vote (STV), a unique voting method with notable advantages over other common electoral systems. The author presents evidence that STV is computationally resistant to strategic voting, meaning it is inherently difficult to manipulate the system to achieve a desired outcome. This resistance to manipulation sets STV apart from other voting schemes and could potentially enhance the integrity of social choice. The book delves into the mechanics of STV, explaining how it works and how it differs from other voting methods. It also explores the concept of non-monotonicity, a potential flaw in voting systems where a candidate's support can decrease despite gaining more votes. The author demonstrates that while non-monotonicity is possible in STV, it is also computationally challenging to identify, suggesting that this potential issue may not be as significant as previously thought. The book's analysis is significant because it sheds light on the complexities of voting systems and the challenges of achieving fair and democratic elections. By examining the computational aspects of STV, the author contributes to a deeper understanding of how voting systems can be designed to resist manipulation and promote more accurate representation of voter preferences. 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.
-
Paperback. Condition: 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.
-
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.
-
Paperback. Condition: New. Print on Demand. This book presents two efficient, polynomial-time algorithms for solving minimum cost network flow problems, a prevalent problem in network optimization with applications in areas such as logistics and telecommunications. The first algorithm, a modification of the Edmonds-Karp scaling technique, is genuinely polynomial, meaning the number of arithmetic operations it takes to find a solution is independent of the size of the input data. The second algorithm is a dual simplex algorithm that is also genuinely polynomial and may be implemented to run in time proportional to the Edmonds-Karp scaling technique. This book makes several contributions to the field of network optimization, including a new theoretical framework for analyzing the efficiency of minimum cost network flow algorithms and the development of new algorithms that are both theoretically and practically efficient. 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.
-
Condition: New.
-
Paperback. Condition: Brand New. 216 pages. 9.25x6.12x9.21 inches. In Stock.
-
Condition: New.
-
A Fast and Simple Algorithm for the Maximum Flow Problem
Language: English
Published by LIGHTNING SOURCE INC, 2015
ISBN 10: 1341791335 ISBN 13: 9781341791338
Condition: New.
