Abstract

AbstractA necessary condition for synthesis of multicommodity flow networks is derived. The feasible flow region of a multicommodity flow network is shown to be an antiblocking polyhedron with rational slopes. Also, it is established that this condition is sufficient for two‐commodity flow networks. A synthesis algorithm for two‐commodity flow networks is proposed. The size of the resulting networks is studied and for some regions it is shown to be pseudolinear; in the worst case the network found by the algorithm is optimal to within a constant factor.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.