Abstract
Abstract The state-of-the-art of deterministic networks is surveyed with a discussion of shortest path, transportation, assignment, transshipment, maximum flow, minimum spanning tree, Chinese postman, Euler path and multicommodity flow models. The computational complexity of network models is discussed. The survey concentrates on models and algorithms that can be used to solve large-scale problems.
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 callDisclaimer: 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.
