Залежність цільової функції в задачах комбінаторної оптимізації від багатьох змінних та гібридні алгоритми

Abstract

The article shows that the objective function in the problems of combinatorial optimization can depend both on one and on several variables which are combinatorial configurations of different types. Problems, objective function in which depends on many variables are divided into sub problems and need, for their solution development of combined (hybrid) algorithms.