Synopsis
This book introduces a groundbreaking method called SAM.M to solve large-scale multicommodity flow problems in networks effectively. In multicommodity network flow problems, multiple commodities need to be transported from their origins to destinations while adhering to specified capacity constraints. SAM.M is a unique algorithm that decomposes the problem into a sequence of smaller, more manageable penalty problems, making it suitable for solving complex network flow problems in the real world. The book meticulously analyzes the performance of SAM.M, demonstrating its theoretical guarantees and computational efficiency. The author establishes that SAM.M consistently finds high-quality solutions, often reaching optimality or near-optimality, and its computational time compares favorably to other existing methods. The author also explores variations of the SAM.M algorithm, extending its applicability to feasibility multicommodity flow problems and maximum concurrent flow problems. Overall, this book provides a comprehensive understanding of the SAM.M algorithm and its significance for solving multicommodity flow problems efficiently. With its in-depth analysis and practical insights, this book is a valuable resource for researchers, practitioners, and students in operations research, network optimization, and computer science.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for A Scaling Algorithm for Multicommodity Flow Problems...
Seller Image
A Scaling Algorithm for Multicommodity Flow Problems (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book introduces a groundbreaking method called SAM.M to solve large-scale multicommodity flow problems in networks effectively. In multicommodity network flow problems, multiple commodities need to be transported from their origins to destinations while adhering to specified capacity constraints. SAM.M is a unique algorithm that decomposes the problem into a sequence of smaller, more manageable penalty problems, making it suitable for solving complex network flow problems in the real world. The book meticulously analyzes the performance of SAM.M, demonstrating its theoretical guarantees and computational efficiency. The author establishes that SAM.M consistently finds high-quality solutions, often reaching optimality or near-optimality, and its computational time compares favorably to other existing methods. The author also explores variations of the SAM.M algorithm, extending its applicability to feasibility multicommodity flow problems and maximum concurrent flow problems. Overall, this book provides a comprehensive understanding of the SAM.M algorithm and its significance for solving multicommodity flow problems efficiently. With its in-depth analysis and practical insights, this book is a valuable resource for researchers, practitioners, and students in operations research, network optimization, and computer science. 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 # 9781334017025_0
Buy New
US$ 17.34
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
A Scaling Algorithm for Multicommodity Flow Problems 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 # LX-9781334017025
Stock Image
A Scaling Algorithm for Multicommodity Flow Problems 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 # LX-9781334017025
Buy New
US$ 23.80
US$ 4.40 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available