A Scaling Algorithm for Multicommodity Flow Problems (Classic Reprint) - Hardcover

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.