Parviz Partow-Navid

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
--This paper addresses a special class of deterministic dynamic programming problems which can be formulated as a genera&d 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(More)
  • 1