The method of second differences for local optimizing in combinatorial hill-climbing problems

Effective hill climbing algorithms are proposed for finding a local maximum of a functional on combinatorial sets. Conditions are found which are imposed on the functional and the system of vicinities of the feasible set under which the computation load can be reduced by using second differences of the functional with recurrence recomputation of the functional values in locally optimal descent.