Parviz Partow-Navid
California State University, Los Angeles
Computers & Operations Research | 1985
Darwin Klingman; Ronald D. Armstrong; Parviz Partow-Navid
Abstract This paper addresses a special class of deterministic dynamic programming problems which can be formulated as a generalized network problem. Because of the similarities between this class of dynamic programming problems and shortest path problems, we are naming it the Generalized Shortest Path problem. A new primal extreme point algorithm and a new special dual algorithm are proposed here. While researchers have presented a variety of algorithms to solve this class of problems, there has been no comuptational analysis of these algorithms. An in-depth computational analysis is performed to determine the most efficient set of rules for implementing the algorithms of this paper.
Journal of Information Privacy and Security | 2012
Ludwig Slusky; Parviz Partow-Navid
Archive | 2009
Ludwig Slusky; Parviz Partow-Navid; Mohit Doshi
T.H.E. Journal Technological Horizons in Education | 1999
Parviz Partow-Navid; Ludwig Slusky
Archive | 2008
Ludwig Slusky; Parviz Partow-Navid
Archive | 2009
Parviz Partow-Navid; Ludwig Slusky
Archive | 2008
Parviz Partow-Navid; Ludwig Slusky
Archive | 2007
Parviz Partow-Navid; Ludwig Slusky
E-Learn: World Conference on E-Learning in Corporate, Government, Healthcare, and Higher Education | 2012
Ludwig Slusky; Parviz Partow-Navid
E-Learn: World Conference on E-Learning in Corporate, Government, Healthcare, and Higher Education | 2009
Ludwig Slusky; Parviz Partow-Navid
