A matroid generalization of the stable matching polytope

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2081, Issue , 2001, Pages 105-114

  Fleiner, Tamás ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION;

LINEAR CONDITIONS; MATROID INTERSECTION; POLYTOPES; STABLE MARRIAGES; STABLE MATCHING;

INTEGER PROGRAMMING;

EID: 84947217370     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45535-3_9     Document Type: Conference Paper

References (13)

1. Jack Edmonds. Submodular functions, matroids, and certain polyhedra. In Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969), pages 69-87. Gordon and Breach, New York, 1970.
2. Jack Edmonds. Matroids and the greedy algorithm. Math. Programming, 1:127-136, 1971.
3. Tamás Fleiner. A fixed-point approach to stable matchings and some applications. Submitted to Mathematics of Operartions Research, 2000.
4. Tamás Fleiner. A fixed-point approach to stable matchings and some applications. Egres Technical Report TR-2001-01, http://www.cs.elte.hu/egres/, 2000 March.
5. Tamás Fleiner. Stable and srossing structures, 2000. PhD dissertation, www.renyi.hu/~fleiner.
6. D. R. Fulkerson. Blocking polyhedra. In Graph Theory and its Applications (Proc. Advanced Sem., Math. Research Center, Univ. of Wisconsin, Madison, Wis., 1969), pages 93-112. Academic Press, New York, 1970.
7. D. R. Fulkerson. Blocking and anti-blocking pairs of polyhedra. Math. Programming, 1:168-194, 1971.
8. D. R. Fulkerson. Anti-blocking polyhedra. J. Combinatorial Theory Ser. B, 12:50-71, 1972.
9. D. Gale and L.S. Shapley. College admissions and stability of marriage. Amer. Math. Monthly, 69(1):9-15, 1962.
10. A. J. Homan and D. E. Schwartz. On lattice polyhedra. In Combinatorics Proc. Fifth Hungarian Colloq., Keszthely, (1976), Vol. I, pages 593-598. North-Holland, Amsterdam, 1978.
11. Alvin E. Roth. Conflict and coincidence of interest in job matching: some new results and open questions. Math. Oper. Res., 10(3):379-389, 1985.
12. Uriel G. Rothblum. Characterization of stable matchings as extreme points of a polytope. Math. Programming, 54(1):57-67, 1992.
13. John H., Vande Vate. Linear programming brings marital bliss. Oper. Res. Lett., 8(3):147-153, 1989.