Sinossi
Excerpt from A Scaling Algorithm for Multicommodity Flow Problems
After relaxing the bundle constraints, the remaining constraints in decompose into the constraints of K single commodity flow problems. The objective function, however, is non separable and nonlinear. Hence, we eliminate the complicating constraints, but introduce nonlinear (convex) and non-separable terms into the objective function.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per A Scaling Algorithm for Multicommodity Flow Problems...
Immagini fornite dal venditore
A Scaling Algorithm for Multicommodity Flow Problems (Classic Reprint)
Print on DemandDa: Forgotten Books, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9781334017025_0
Compra nuovo
EUR 15,21
Spedizione gratuita
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
A Scaling Algorithm for Multicommodity Flow Problems Classic Reprint
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LX-9781334017025
Compra nuovo
EUR 17,05
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 15 disponibili
Foto dell'editore
A Scaling Algorithm for Multicommodity Flow Problems Classic Reprint
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LX-9781334017025
Compra nuovo
EUR 20,28
EUR 3,75 shipping
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 15 disponibili