Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type

  • Authors:

  • P. Bonzon

  • Affiliations:

  • Department of Industrial Engineering, University of Toronto, Toronto, Ontario, Canada and Swiss Federal Institute of Technology, Lausanne, Switzerland

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1970

Quantified Score

Hi-index 0.01

Visualization

Abstract

A general formulation of discrete deterministic dynamic programming is given. This definition is obtained formally by derivation of a simplified algorithm from a general algorithm, and gives simultaneously the class of concurrent problems.