On non-{0, 1/2, 1} extreme points of the generalized transitive tournament polytope

Linear Algebra and Its Applications

Volumn 233, Issue , 1996, Pages 149-159

  Nutov, Zeev ^a   Penn, Michal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21844515617     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/0024-3795(94)00063-8     Document Type: Article

References (14)

1. A. Borobia, (0, 1/2, 1) matrices which are extreme points of the generalized transitive tournament polytope, Linear Algebra Appl. 220:97-110 (1995).
2. R. A. Brualdi and G.-S. Hwang, Generalized transitive tournaments and double stochastic matrices, Linear Algebra Appl. 172:151-168 (1992).
3. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Macmillan, London, 1976.
4. A. Cruse, On removing a verex from the assignment polytope, Linear Algebra Appl. 26:45-57 (1979).
5. T. Dridi, Sur les distributions binaires associées à des destributions ordinales, Math, et Sci. Humaines 69:15-31 (1980).
6. I. Gilboa, A necessary but insufficient condition for the stochastic binary choice problem, J. Math. Psychol. 34:371-392 (1990).
7. M. Grötchel, M. Jünger, and G. Reinelt, Acyclic subdigraphs and linear orderings: Polytopes, facets, and a cutting plane algorithm, Graphs and Orders, 1985, pp. 217-264.
8. M. Jünger, Polyhedral Combinatorics and the Acyclic Subdigraph Problem, Helderman, Berlin, 1985.
9. J. Leung and J. Lee, More facets from fences for linear ordering and acyclic subdigraph polytopes, Discrete Appl. Math. 50:185-200 (1994).
10. Z. Nutov and M. Penn, On the integral dicycle packings and covers and the linear ordering polytope, Discrete Appl. Math. 60:293-309 (1995).
11. G. Reinelt, The Linear Ordering Problem: Algorithms and Applications, Helderman, Berlin, 1985.
12. G. Reinelt, A Note on Small Linear Ordering Polytopes, Report 329, Inst. für Mathematik, Univ. Augsburg, 1991.
13. A. Schrijver, Theory of Linear and Integer Programming, Wiley-InterScience, New York, 1986.
14. S. Suck, Geometrical and Combinatorial Properties of the Polytope of Binary Choice Probabilities, Mathematical Social Sciences 23:81-102 (1992).