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.
Original languageEnglish
Title of host publicationUncertainty in Intelligent and Information Systems
EditorsB. Bouchon-Meunier, R. Yager, L. Zadeh
Place of PublicationUSA
PublisherWorld Scientific
Publication statusPublished - 2000

Publication series

NameSeries on Advances in Fuzzy Systems- Applications and Theory
PublisherWorld Scientific
ISSN (Print)2010-2771


Dive into the research topics of 'Why leximin FCSPs are so hard for local search'. Together they form a unique fingerprint.

Cite this