Revision as of 20:17, 15 October 2006 edit Henning Makholm (talk \| contribs) Extended confirmed users, Rollbackers 7,454 edits Solutions for constrained problems ← Previous edit		Revision as of 01:56, 25 October 2006 edit undo Tom Duff (talk \| contribs) 368 edits →Solutions for constrained problems Next edit →
Line 18: Anybody know if there are computationally feasible algorithms for solving marriage problems with constraints, e.g. "Is there any stable pairing that matches Alice with Bob and Claire with Dave?" [[User:Henning Makholm\|Henning Makholm]] 20:17, 15 October 2006 (UTC) * Your example is still just the Stable Marriage problem, using a list that excludes Alice, Bob, Claire and Dave. [[User:Tom Duff\|Tom Duff]] 01:56, 25 October 2006 (UTC)

Talk:Stable matching problem: Difference between revisions