A new heuristic algorithm solving the linear ordering problem

摘要: The linear ordering problem is an NP-hard combinatorial with a large number of applications. Contrary to another very popular from the same category, traveling salesman problem, relatively little space in literature has been devoted so far. This particularly true for question developing good heuristic algorithms solving this problem. In paper we propose new algorithm made use sorting through insertion pattern as well operation permutation reversal. surprisingly positive effect reversal operation, justified part theoretically and confirmed computational examples, seems be result unique property called symmetry consists fact that if given optimal solution criterion function being maximized, then reversed minimized.