Abstract
Designing minimum cost networks to satisfy a given set of single-commodity or multi-commodity flow requirements is a basic problem which has many applications in transportation and communication networks. A few of the most common models are reviewed in this paper along with recent progress in the computation of lower bounds and exact solution algorithms. Computational results are provided and discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Logistics Research and Applications
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.