E. Alba, G. Luque, and S. Nesmachnow, Parallel metaheuristics: recent advances and new trends, International Transactions in Operational Research, vol.39, issue.3, pp.1-48, 2013.
DOI : 10.1111/j.1475-3995.2012.00862.x

E. Alba, Parallel Metaheuristics: A New Class of Algorithms, 2005.
DOI : 10.1002/0471739383

Y. Caniou, P. Codognet, F. Richoux, D. Diaz, and S. Abreu, Large-scale parallelism for constraint-based local search: the costas array case study, Constraints, vol.190, issue.2, 2014.
DOI : 10.1007/s10601-014-9168-4
URL : https://hal.archives-ouvertes.fr/hal-01084270

P. Codognet and D. Diaz, Yet Another Local Search Method for Constraint Solving, proceedings of SAGA'01, pp.73-90, 2001.
DOI : 10.1007/3-540-45322-9_5
URL : https://hal.archives-ouvertes.fr/hal-00667941

P. Codognet and D. Diaz, An Efficient Library for Solving CSP with Local Search, 5th international Conference on Metaheuristics, pp.1-6, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00693282

D. Gale and L. S. Shapley, College Admissions and the Stability of Marriage, The American Mathematical Monthly, vol.69, issue.1, pp.9-15, 1962.
DOI : 10.2307/2312726

M. Gelain, M. Pini, F. Rossi, K. B. Venable, and T. Walsh, Local Search for Stable Marriage Problems with Ties and Incomplete Lists, PRICAI 2010: Trends in Artificial Intelligence, pp.64-75, 2010.
DOI : 10.1007/978-3-642-15246-7_9

M. Gelain, M. Pini, F. Rossi, K. Venable, and T. Walsh, Local Search Approaches in Stable Matching Problems, Local Search Approaches in Stable Matching Problems, pp.591-617, 2013.
DOI : 10.3390/a6040591

I. P. Gent and P. Prosser, An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists, ECAI 2002, pp.141-145, 2002.

I. P. Gent, R. W. Irving, D. F. Manlove, P. Prosser, and B. M. Smith, A Constraint Programming Approach to the Stable Marriage Problem, CP01, pp.225-239, 2001.
DOI : 10.1007/3-540-45578-7_16

I. Gent, P. Prosser, B. Smith, and T. Walsh, SAT Encodings of the Stable Marriage Problem with Ties and Incomplete Lists, SAT, pp.133-140, 2002.

S. Miyazaki, Y. Morita, and S. Scott, Approximability results for stable marriage problems with ties, 2003.

M. M. Halldórsson, K. Iwama, S. Miyazaki, and H. Yanagisawa, Improved approximation results for the stable marriage problem, ACM Transactions on Algorithms, vol.3, issue.3, 2007.
DOI : 10.1145/1273340.1273346

R. W. Irving, Stable marriage and indifference, Discrete Applied Mathematics, vol.48, issue.3, pp.261-272, 1994.
DOI : 10.1016/0166-218X(92)00179-P
URL : http://doi.org/10.1016/0166-218x(92)00179-p

K. Iwama and S. Miyazaki, A Survey of the Stable Marriage Problem and Its Variants, International Conference on Informatics Education and Research for Knowledge-Circulating Society (icks 2008), p.8, 2008.
DOI : 10.1109/ICKS.2008.7

K. Iwama, D. Manlove, S. Miyazaki, and Y. Morita, Stable Marriage with Incomplete Lists and Ties, ICALP, pp.443-452, 1999.
DOI : 10.1007/3-540-48523-6_41
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.3310

Z. Király, Approximation of Maximum Stable Marriage, 2011.

Z. Király, Linear Time Local Approximation Algorithm for Maximum Stable Marriage, Algorithms, vol.6, issue.3, pp.471-484, 2013.
DOI : 10.3390/a6030471

F. Klijn and J. Massó, Weak stability and a bargaining set for the marriage model, Games and Economic Behavior, vol.42, issue.1, pp.91-100, 2003.
DOI : 10.1016/S0899-8256(02)00534-1

A. Kwanashie and D. Manlove, An Integer Programming Approach to the Hospitals/Residents Problem with Ties, 2013.
DOI : 10.1007/978-3-319-07001-8_36

D. Manlove, R. W. Irving, K. Iwama, S. Miyazaki, and Y. Morita, Hard variants of stable marriage, Theoretical Computer Science, vol.276, issue.1-2, pp.261-279, 2002.
DOI : 10.1016/S0304-3975(01)00206-7

D. Manlove, G. Malley, P. Prosser, C. Unsworth, and E. J. Mcdermid, A Constraint Programming Approach to the Hospitals / Residents Problem A 3/2-Approximation Algorithm for General Stable Marriage, International Colloquium on Automata, Languages and Programming, pp.689-700, 2007.

D. Munera, D. Diaz, S. Abreu, P. Codognet, and S. Abreu, A parametric framework for cooperative parallel local search Towards parallel constraint-based local search with the X10 language, Evolutionary Computation in Combinatorial Optimisation -14th European Conference Declarative Programming and Knowledge Management - Declarative Programming Days, pp.13-24, 2013.

K. E. Paluch, Faster and Simpler Approximation of Stable Matchings, Algorithms, vol.7, issue.2, pp.189-202, 2014.
DOI : 10.3390/a7020189

A. Podhradsky, Stable Marriage Problem Algorithms, 2010.

S. Scott, A Study of Stable Marriage Problems with Ties, 2005.

M. Toulouse, T. G. Crainic, and B. Sans, Systemic behavior of cooperative search algorithms, Parallel Computing, vol.30, issue.1, pp.57-79, 2004.
DOI : 10.1016/j.parco.2002.07.001

C. Unsworth and P. Prosser, An n-ary Constraint for the Stable Marriage Problem, 2013.

V. Vate and J. H. , Linear programming brings marital bliss, Operations Research Letters, vol.8, issue.3, pp.147-153, 1989.
DOI : 10.1016/0167-6377(89)90041-2

M. Verhoeven and E. Aarts, Parallel local search, Journal of Heuristics, vol.17, issue.1, pp.43-65, 1995.
DOI : 10.1007/BF02430365