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

Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/140173

DC Field	Value
dc.title	On a cutting plane heuristic for the stable roommates problem and its applications
dc.contributor.author	Teo, Chung-Piaw
dc.contributor.author	Sethuraman, Jay
dc.date.accessioned	2018-04-18T08:40:08Z
dc.date.available	2018-04-18T08:40:08Z
dc.date.issued	1998-04
dc.identifier.citation	Teo, Chung-Piaw, Sethuraman, Jay (1998-04). On a cutting plane heuristic for the stable roommates problem and its applications. Research Paper Series (National University of Singapore. Faculty of Business Administration); 1998-019 : 1-17. ScholarBank@NUS Repository.
dc.identifier.uri	http://scholarbank.nus.edu.sg/handle/10635/140173
dc.relation.ispartofseries	Research Paper Series; 1998-019
dc.type	Working Paper/Technical Report
dc.contributor.department	DECISION SCIENCES
dc.description.sourcetitle	Research Paper Series (National University of Singapore. Faculty of Business Administration); 1998-019
dc.description.page	1-17
dc.grant.id	RP 3970021
dc.grant.fundingagency	University Research Grant
Appears in Collections:	Staff Publications Elements

File	Description	Size	Format	Access Settings	Version
b20158580.pdf		1.51 MB	Adobe PDF	OPEN	None	View/Download

Check