SAT Is an Effective and Complete Method for Solving Stable Matching Problems with Couples. Drummond, J., Perrault, A., & Bacchus, F. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pages 518–525, 2015.
SAT Is an Effective and Complete Method for Solving Stable Matching Problems with Couples [link]Paper  bibtex   
@InProceedings{DBLP:conf/ijcai/DrummondPB15,
  Title                    = {{SAT} Is an Effective and Complete Method for Solving Stable Matching
 Problems with Couples},
  Author                   = {Joanna Drummond and
 Andrew Perrault and
 Fahiem Bacchus},
  Booktitle                = {Proceedings of the Twenty-Fourth International Joint Conference on
 Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July
 25-31, 2015},
  Year                     = {2015},
  Pages                    = {518--525},

  Bibsource                = {dblp computer science bibliography, https://dblp.org},
  Biburl                   = {https://dblp.org/rec/bib/conf/ijcai/DrummondPB15},
  Timestamp                = {Wed, 20 Jul 2016 15:18:06 +0200},
  Url                      = {http://ijcai.org/Abstract/15/079}
}

Downloads: 0