@inbook{0577caa9733a4e23ba5b98a067ea1f2e,
title = "Why leximin FCSPs are so hard for local search",
abstract = "In this paper we investigate why solving leximin fuzzy constraint satisfaction problems (FCSP) with non-enumerative algorithms, such as hill-climbing, simulated annealing and genetic algorithms, provide disappointing results. Specifically, we analyse the structure and properties of the leximin FCSPs and its influence on the search strategy of non-enumerative algorithms.",
author = "{Moura Pires}, Jo{\~a}o and Ribeiro, {Maria Rita Sarmento de Almeida} and Pires, {Fernando Moura}",
year = "2000",
doi = "10.1142/9789812792563_0015",
language = "English",
series = "Series on Advances in Fuzzy Systems- Applications and Theory",
publisher = "World Scientific",
pages = "185--196",
editor = "B. Bouchon-Meunier and R. Yager and L. Zadeh",
booktitle = "Uncertainty in Intelligent and Information Systems",
}