Effective utilization of nonserial dynamic programming in combinatorial optimization

Sufficient conditions are proved for a nonserial dynamic programming algorithm to be executed in the polynomial time. As corollaries the algorithm solves some optimization problems on new classes of graphs in polynomial time.