Zur graphenthcoretischen lösung einer klasse von diskreten optimierungsproblemen

Abstract

The paper deals with a special class of discrete dynamic optimization problems. The problem was solved by Nozcka by the method of dynamic programming. For the same task we have made a graph-theoretic approach. The advantage thereby is possibility of estimating the numerical expense before the beginning of the computation. A well known puzzle has been solved by the presented method. Numerical results are given.