作者: Martin Grötschel , Michael Jünger , Gerhard Reinelt
DOI: 10.1007/BF01582010
关键词:
摘要: LetD n be the complete digraph onn nodes, and letP LO denote convex hull of all incidence vectors arc sets linear orderings nodes ofD (i.e. these are exactly acyclic tournaments ). We show that various classes inequalities define facets ofP , e.g. 3-dicycle inequalities, simplek-fence Mobius ladder we discuss use in cutting plane approaches to triangulation problem input-output matrices, i.e. solution permutation resp. ordering problems.