Abstract

In this chapter, we present an algorithm for multi-stage optimization of paths in a directed graph relative to different cost functions. We consider two types of cost functions: for a given path, a function of the first type is equal to the sum of weights of edges in the path, and a function of the second type is equal to the minimum weight of some edge in the path. Weights of edges for different cost functions can be different. We study the problem of minimization for functions of the first type, and the problem of maximization for functions of the second type.

Full Text
Published version (Free)

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