Abstract
Publisher Summary A truly remarkable variety of discrete optimization problems can be formulated and solved as shortest path or network flow problems or can be solved by procedures that employ shortest path or network flow algorithms as subroutines. It follows that these network computations are among the most fundamental and important in the entire area of discrete optimization. This chapter presents a survey of several more “classic” results for some of the more “standard” problem formulations. In each case, an estimate of the worst-case running time of the algorithm is presented in the chapter. Bellman's equations is also discussed; virtually, all the methods for finding the length of a shortest path between two specified nodes embed the problem in the larger problem of finding the lengths of shortest paths from an origin to each of the other nodes in the network.
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.
