SOLVABLE PROBLEM AND СOMBINATORIAL OPTIMIZATION

Abstract

А structure-alphabetical search method of decision of problems of сombinatorial optimization, based on
recognition of a structure of input data and one solvable case, characterized by high speed and accuracy of finding the optimal result is described. It is also shown that some the unsolvable problems of this class are taken to polynomial solvable or contain the subclass of solvable problems.