Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Abstract— For solving multimodal problems by means of evolutionary algorithms, one often resorts to multistarts or niching methods. The latter approach the question: ‘What is e...
This paper presents a new meta heuristic algorithm based on the search method called simulated annealing, and its application to solving multi objective simulation optimization pr...
Eduardo Alberto Avello, Felipe F. Baesler, Reinald...
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasi...