Optimization of dynamic programming methods in the solution of extremal combinatorial problems

V. O. Groppen

Ordzhonikidze

Abstract: An approach is proposed whereby the realization of dinamic programming methods for extremal combinatorial problems is optimized. The optimization goal function minimizes the upperbound of the computation time or the computer memory size. Efficiency of the approach is illustrated with examples.

UDC: 62-506, 519.83


Received: 28.11.1984

 English version: Automation and Remote Control, 1985, 46, 1561–1566

Bibliographic databases:

• 
•