On a cutting plane heuristic for the stable roommates problem and its applications

European Journal of Operational Research

Volumn 123, Issue 1, 2000, Pages 195-205

  Teo, Chung Piaw ^a   Sethuraman, Jay ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; GEOMETRY; HEURISTIC METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

CUTTING PLANE HEURISTIC; RANDOMIZED ROUNDING; STABLE MATCHING; STABLE ROOMMATES PROBLEM;

OPERATIONS RESEARCH;

EID: 0033871485     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00049-1     Document Type: Article

References (15)

1. G Abeledo H., Blum Y. Stable matchings and linear programming. Linear Algebra and Its Applications. 245:1996;321-333.
2. Abeledo H.G., Rothblum U.G. Stable matching and linear inequalities. Discrete Applied Mathematics. 54:1994;1-27.
3. Edmonds J. Maximum matching and a polyhedron with 0-1 vertices. Journal of Research of the National Bureau Standards. 69B:1965;125-130.
4. Feder T. A new fixed point approach for stable networks and stable marriages. Journal of Computer and System Sciences. 45:1992;233-284.
5. Gale D., Shapley L.S. College admissions and the stability of marriage. American Mathematical Monthly. 69:1962;9-15.
6. D. Gusfield, R.W. Irving (Eds.), The Stable Marriage Problem: Structure and Algorithms, MIT Press, Cambridge, MA, 1989.
7. Gusfield D., Pitt L. A bounded approximation for the minimum cost 2-Sat problem. Algorithmica. 8(2):1992;103-117.
8. Irving R.W. An efficient algorithm for the stable roommates problem. Journal of Algorithms. 6:1985;577-595.
9. Irving R.W., Leather P., Gusfield D. An efficient algorithm for the optimal stable marriage problem. Journal of the Association of Computing Machinery. 34:1987;532-543.
10. D.E. Knuth, Marriages Stables, Les Presses de l'Université de Montréal, Montreal, 1976.
11. Roth A.E., Rothblum U.G., Vande Vate J.H. Stable matching, optimal assignments and linear programming. Mathematics of Operations Research. 18:1993;803-828.
12. Rothblum U.G. Characterization of stable matchings as extreme points of a polytope. Mathematical Programming. 54:1992;57-67.
13. Subramanian A. A new approach to stable matching problems. SIAM Journal of Computing. 23:1994;671-700.
14. C.P. Teo, J. Sethuraman, Geometry of fractional stable matchings and its applications, Mathematics of Operations Research, (to appear).
15. Vande Vate J.H. Linear programming brings marital bliss. Operations Research Letters. 8:1989;147-153.