Please use this identifier to cite or link to this item:
|Title:||On a cutting plane heuristic for the stable roommates problem and its applications||Authors:||Teo, C.-P.
|Issue Date:||2000||Citation:||Teo, C.-P., Sethuraman, J. (2000). On a cutting plane heuristic for the stable roommates problem and its applications. European Journal of Operational Research 123 (1) : 195-205. ScholarBank@NUS Repository. https://doi.org/10.1016/S0377-2217(99)00049-1||Abstract:||We propose a new cutting plane heuristic for the classical stable roommates problem. Our approach utilises a new linear programming formulation for the problem, and the underlying geometric properties of the fractional solution to construct the violated inequality. We test the approach on moderate size problems, with encouraging computational performance. To further illustrate the versatility of this approach, we also show how it can be suitably extended to handle variants of the basic stable roommates model.||Source Title:||European Journal of Operational Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/44958||ISSN:||03772217||DOI:||10.1016/S0377-2217(99)00049-1|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 3, 2019
WEB OF SCIENCETM
checked on Nov 26, 2019
checked on Dec 2, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.