메뉴 건너뛰기




Volumn 12, Issue 3, 1999, Pages 326-336

New facets of the linear ordering polytope

Author keywords

Facets; Linear ordering; Linear ordering polytope; Ranking

Indexed keywords


EID: 0037734885     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480196300145     Document Type: Article
Times cited : (35)

References (14)
  • 1
    • 85034549593 scopus 로고
    • On the facets of the permutation polytope
    • in Russian
    • G G. BOLOTASHVILI, On the facets of the permutation polytope, Commun. Georgian Acad. Sci., 121 (1986), pp. 281-284 (in Russian).
    • (1986) Commun. Georgian Acad. Sci. , vol.121 , pp. 281-284
    • Bolotashvili, G.G.1
  • 4
    • 0009629944 scopus 로고
    • Permutation polyhedra
    • V. J. BOWMAN, Permutation polyhedra, SIAM J. Appl. Math., 22 (1972), pp. 586-589.
    • (1972) SIAM J. Appl. Math. , vol.22 , pp. 586-589
    • Bowman, V.J.1
  • 5
    • 0037725111 scopus 로고
    • Binary probabilities induced by rankings
    • P. FISHBURN, Binary probabilities induced by rankings, SIAM J. Discrete Math., 3 (1990), pp. 478-488.
    • (1990) SIAM J. Discrete Math. , vol.3 , pp. 478-488
    • Fishburn, P.1
  • 6
    • 38249014155 scopus 로고
    • Induced binary probabilities and the linear ordering polytope: A status report
    • P. FISHBURN, Induced binary probabilities and the linear ordering polytope: A status report, Math. Social Sci., 23 (1992), pp. 67-80.
    • (1992) Math. Social Sci. , vol.23 , pp. 67-80
    • Fishburn, P.1
  • 8
    • 0021521702 scopus 로고
    • A cutting plane algorithm for the linear ordering problem
    • M. GRÖTSCHEL, M. JÜNGER, AND G. REINELT, A cutting plane algorithm for the linear ordering problem, Oper. Res., 32 (1984), pp. 1195-1220.
    • (1984) Oper. Res. , vol.32 , pp. 1195-1220
    • Grötschel, M.1    Jünger, M.2    Reinelt, G.3
  • 10
    • 38149147249 scopus 로고
    • More facets from fences for linear ordering and acyclic subgraph polytopes
    • J. LEUNG AND J. LEE, More facets from fences for linear ordering and acyclic subgraph polytopes, Discrete Appl. Math., 50 (1994), pp. 185-200.
    • (1994) Discrete Appl. Math. , vol.50 , pp. 185-200
    • Leung, J.1    Lee, J.2
  • 11
    • 0346305540 scopus 로고
    • Binary stochastic choice
    • J. S. Chipman, D. McFadden, and M. K. Richter, eds., Westview Press, Boulder, CO
    • A. MCLENNAN, Binary stochastic choice, in Preferences, Uncertainty and Optimality, J. S. Chipman, D. McFadden, and M. K. Richter, eds., Westview Press, Boulder, CO, 1990, pp. 187-202.
    • (1990) Preferences, Uncertainty and Optimality , pp. 187-202
    • Mclennan, A.1
  • 12
    • 0342746850 scopus 로고
    • The Linear Ordering Problem: Algorithms and Applications
    • Heldermann Verlag, Berlin
    • G. REINELT, The Linear Ordering Problem: Algorithms and Applications, Res. Exp. Math. 8, Heldermann Verlag, Berlin, 1985.
    • (1985) Res. Exp. Math. , vol.8
    • Reinelt, G.1
  • 13
    • 51249162633 scopus 로고
    • A note on small linear ordering polytope
    • G. REINELT, A note on small linear ordering polytope, Discrete Comput. Geom., 10 (1993), pp. 67-78.
    • (1993) Discrete Comput. Geom. , vol.10 , pp. 67-78
    • Reinelt, G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.