A maximum b-matching problem arising from median location models with applications to the roommates problem

Mathematical Programming, Series B

Volumn 80, Issue 2, 1998, Pages 171-194

  Tamir, Arie ^a   Mitchell, Joseph S B ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b STONY BROOK UNIVERSITY   (United States)

Author keywords

Median location problems; The b matching problem; The roommates problem

Indexed keywords

EID: 0007070646     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01581725     Document Type: Article

References (26)

1. H. Alt and E. Welzl, Visibility graphs and obstacle-avoiding shortest paths, Zeitschrift für Operations Research 32 (1988) 145-164.
2. R.P. Anstee, A polynomial algorithm for b-matchings: An alternative approach, Information Processing Letters 24 (1987) 153-157.
3. J. Bartholdi and M.A. Trick, Stable matching with preferences derived from psychological model, Operations Research Letters 5 (1986) 165-169.
4. W. Cook and W.R. Pulleyblank, Linear systems for constrained matching problems, Mathematics of Operations Research 12 (1987) 97-120.
5. W.H. Cunningham and A.B. Marsh III, A primal algorithm for optimum matching, Mathematical Programming Study 8 (1978) 50-72.
6. E. Erkut, R.L. Francis, T.J. Lowe and A. Tamir, Equivalent mathematical programming formulations of tree network location problems, Operations Research 37 (1989) 447-461.
7. D. Gale and L.S. Shapley, College admissions and the stability of marriage, American Mathematical Monthly 69 (1962) 9-14.
8. O. Gerstel and S. Zaks, A new characterization of tree medians with applications to distributed sorting, Networks 24 (1994) 23-39.
9. A.J. Goldman, Optimal center location in simple networks, Transportation Science 5 (1971) 212-221.
10. D. Granot, A note on the roommates problem and a related revenue allocation problem, Management Science 30 (1984) 633-643.
11. D. Gusfield and R.W. Irving, The Stable Marriage Problem (MIT Press, Cambridge, MA, 1989).
12. J. Hershberger and S. Suri, Matrix searching with the shortest path metric, Proceedings of the 25th Annal ACM Symposium on Theory of Computing (1993) 485-494.
13. A.N.C. Kang and D. A. Ault, Some properties of a centroid of a free tree, Information Processing Letters 4 (1975) 18-20.
14. O. Kariv and L.S. Hakimi, An algorithmic approach to network location problems. II; The p-medians, SIAM Journal on Applied Mathematics 37 (1979) 539-560.
15. M. Katchalski and H. Last, Disjoint edges in convex position in a geometric graph, in: 4th Israeli Workshop on Computational and Combinatorial Geometry, Eilat, Israel, 1995.
16. Y.S. Kupitz, Extremal problems in combinatorial geometry, M.Sc. Thesis, Aarhus University Lecture Notes Series, Vol. 53, 1979.
17. Y.S. Kupitz, On pairs of disjoint segments in convex position in the plane, Annals of Discrete Mathematics 20 (1984) 203-208.
18. H. Last, Turan Type problems for geometric graphs, M.Sc. Thesis, Technion, Israel Institute of Technology, 1994 (in Hebrew).
19. E. Lawler, Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).
20. L. Lovasz and M.D. Plummer, Matching Theory, Annals of Discrete Mathematics, Vol. 29 (North-Holland, Amsterdam, 1986).
21. O. Marcotte and S. Suri, Fast matching algorithms for points on a polygon, SIAM Journal on Computing 20 (1991) 405-422.
22. G. Owen, On the core of linear production games, Mathematical Programming 9 (1975) 358-370.
23. W.R. Pulleyblank, Faces of matching polyhedra, Ph.D. Thesis, University of Waterloo, Department of Combinatorics and Optimization, 1973.
24. G. Sabidussi, The centrality index of a graph, Psychometrika 31 (1966) 58-603.
25. P Vaidya, Geometry helps in matching, SIAM Journal on Computing 18 (1989) 1201-1225.
26. B. Zelinka, Medians and peripherians of trees, Archivum Mathematicum (Brno) 4 (1968) 87-95.