New methods for multi-commodity flows
Most approaches to multi-commodity flows which are presently successful have used the ideas of linear programming. \textit{M. V. Lomonosov} [Discrete Appl. Math. 11, 1-93 (1985; Zbl 0598.90036)] has reported on work by himself and his colleageus which seems to the present authors to offer promising aspects in generalizing existing graph theory based methodologies to the multi-commodity case. In this paper the authors describe some of the theoretical work of Lomonosov and show how it may be implemented to provide an extremely efficient and practical algorithm for solving certain multi-commodity flow problems. Also described is an example of a network problem solved by this method. Finally, the authors discuss future developments.
- A simple method for improving the primal simplex method for the multicommodity flow problem
- scientific article; zbMATH DE number 515936
- scientific article; zbMATH DE number 1187163
- Progress Made in Solving the Multicommodity Flow Problem
- Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm
- Methods of the convex cone theory in the feasibility problem of multicommodity flow
- Step graphs and their application to the organization of commodity flows in networks
- Online Multi-Commodity Flow with High Demands
- On methods for the convex multi-commodity flow problem
- Advanced start for the multicommodity network flow problem
- scientific article; zbMATH DE number 508828 (Why is no real title available?)
- Basis characterisation for linear multicommodity network programs
- A simple method for improving the primal simplex method for the multicommodity flow problem
- On the 3-Commodity Flow Problem
- Railway scheduling by network optimization
This page was built for publication: New methods for multi-commodity flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q920829)
