Multiple Objective Path Optimization for Time Dependent Objective Functions
Michael M. Kostreva, Laura C. Lancaster · 2002
The study of time dependent, non-monotone increasing objective functions is interesting for several applications of multiple objective path optimization. In this paper an algorithm which finds the set of non-dominated paths is derived and shown to converge. This algorithm does not reduce to dynamic programming, even for constant cost functions. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.