메뉴 건너뛰기
Mathematical Programming, Series B
Volumn 87, Issue 3, 2000, Pages 427-439
The stable admissions polytope
Author keywords

Graphs; Many to one matching; Polytopes; Stable assignment; Stable marriage; Two sided market
Indexed keywords

EID: 0000865934     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050004     Document Type: Article
Times cited : (50)
References (10)
  • 1
    • 0003648968 scopus 로고    scopus 로고
    • Working Paper, Laboratoire d'Économétrie de l'École Polytechnique
    • Baïou, M., Balinski, M. (1998): Admissions via graphs. Working Paper, Laboratoire d'Économétrie de l'École Polytechnique
    • (1998) Admissions Via Graphs
    • Baïou, M.1    Balinski, M.2
  • 2
    • 0002054924 scopus 로고    scopus 로고
    • Many-to-many matching: Stable polyandrous polygamy (or polygamous polyandry)
    • to appear
    • Baïou, M., Balinski, M. (2000): Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry), to appear in Discrete Appl. Math.
    • (2000) Discrete Appl. Math.
    • Baïou, M.1    Balinski, M.2
  • 3
    • 0031371586 scopus 로고    scopus 로고
    • Of stable marriages and graphs, and strategy and polytopes
    • Balinski, M., Ratier, G. (1997): Of stable marriages and graphs, and strategy and polytopes. SIAM Rev. 39, 574-604
    • (1997) SIAM Rev. , vol.39 , pp. 574-604
    • Balinski, M.1    Ratier, G.2
  • 4
  • 5
    • 0003165311 scopus 로고
    • College admissions and the stability of marriage
    • Gale, D., Shapley, L.S. (1962): College admissions and the stability of marriage. Am. Math. Mon. 69, 9-15
    • (1962) Am. Math. Mon. , vol.69 , pp. 9-15
    • Gale, D.1    Shapley, L.S.2
  • 6
    • 51249185617 scopus 로고
    • The ellipsoid method and its consequences in combinatorial optimization
    • Grötschel, M., Lovász, L., Schrijver, A. (1981): The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 70-89
    • (1981) Combinatorica , vol.1 , pp. 70-89
    • Grötschel, M.1    Lovász, L.2    Schrijver, A.3
  • 7
    • 29044434729 scopus 로고    scopus 로고
    • On the stable marriage polytope
    • Ratier, G. (1996): On the stable marriage polytope. Discrete Math. 148, 141-159
    • (1996) Discrete Math. , vol.148 , pp. 141-159
    • Ratier, G.1
  • 8
    • 0008667099 scopus 로고
    • Stable matchings, optimal assignments, and linear programming
    • Roth, A.E., Rothblum, U.G., Vande Vate, J.H. (1993): Stable matchings, optimal assignments, and linear programming. Math. Oper. Res. 18, 803-828
    • (1993) Math. Oper. Res. , vol.18 , pp. 803-828
    • Roth, A.E.1    Rothblum, U.G.2    Vande Vate, J.H.3
  • 9
    • 0026810076 scopus 로고
    • Characterization of stable matchings as extreme points of a polytope
    • Rothblum, U. (1992): Characterization of stable matchings as extreme points of a polytope. Math. Program. 54, 57-67
    • (1992) Math. Program. , vol.54 , pp. 57-67
    • Rothblum, U.1
  • 10
    • 0024683522 scopus 로고
    • Linear programming brings marital bliss
    • Vande Vate, J.H. (1989): Linear programming brings marital bliss. Oper. Res. Lett. 8, 147-153
    • (1989) Oper. Res. Lett. , vol.8 , pp. 147-153
    • Vande Vate, J.H.1

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