The preliminary set of operations is proposed in the paper. This set allows ones to construct a rather standard tool for enumeration in those optimization problems that may be solved with ideas of splitting (as in Branch-and-Bound) and recursion (as in Dynamic programming).
As examples we considered the problems of shortest and the quickest paths in a graph, and the non-serial dynamic programming.
Some experimenal software were developed to check the ideas. It
was described at the end of the paper.
Paper available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1993/93-64.ps