Project Scheduling in And-Or Graphs: A Generalization of Dijkstra's Algorithm George M. Adelson-Velsky and Eugene Levner Mathematics of Operations Research , pp. 504-517 (14 pages) ...

Compared with existing pricing technologies without the "barrier too close" problem, our calculation method can produce a more accurate and efficient analytic evaluation of barrier options monitored ...