Алгоритмы упорядочения переменных в локальном элиминационном алгоритме

Five ordering algorithms for the nonserial dynamic programming algorithm for solvings parse discrete optimization problems are considered. As a result of benchmarking, firstly, it was noted that for solvings parse discrete optimization problems, the ordering of the variables has a significant impact on the run-time of solving the problem. In addition, it was shown that the different heuristics ordering are most effective for different classes of problems. And finally, it was noted that heuristics MCS and MIN-FILL showed the best result for solving discrete optimization problems of the considered class of test problems.