(0, ½, 1) matrices which are extreme points of the generalized transitive tournament polytope
暂无分享,去创建一个
[1] Allan B. Cruse,et al. On removing a vertex from the assignment polytope , 1979 .
[2] Gerhard Reinelt,et al. The linear ordering problem: algorithms and applications , 1985 .
[3] P. Gilmore,et al. A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.
[4] E. Szpilrajn. Sur l'extension de l'ordre partiel , 1930 .
[5] Martin Grötschel,et al. Acyclic Subdigraphs and Linear Orderings: Polytopes, Facets, and a Cutting Plane Algorithm , 1985 .
[6] L. Mirsky,et al. Results and problems in the theory of doubly-stochastic matrices , 1963 .
[7] Richard A. Brualdi,et al. Generalized transitive tournaments and doubly stochastic matrices , 1992 .
[8] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .