Extension of a special class of facets for the polytope of the linear ordering problem
New classes of facets for the linear ordering NP-hard problem polytope are constructed in the form of the system of linear inequalities to solve this problem. The new approach and results of Leung J. and Lee J. for generalization of m-facets are used for construction of facets. Similarly, these results are extended to the (m, k)-facets in the article.