Contains fulltext : 84514.pdf (postprint version ) (Open Access)The 2000 ACM symposium on Applied computing, Como, Italy458 p
textabstractWe present a study on the difficulty of solving binary constraint satisfaction problems ...
In this paper, genetic algorithms for the unconstrained binary quadratic programming problem (BQP) a...
AbstractThe most common application of genetic algorithms to combinatorial optimization problems has...
This paper introduces a genetic local search algorithm for bi-nary constraint satisfaction problems....
SIGLEAvailable from British Library Document Supply Centre- DSC:9109.3968(EU-DCS-CSM--139) / BLDSC -...
The genetic algorithms (GAs) can be used as a global optimization tool for continuous and discrete f...
Contains fulltext : 84511.pdf (preprint version ) (Open Access)the 2000 Congress o...
Contains fulltext : 84503.pdf (author's version ) (Open Access)5th International C...
Constraint handling is not straightforward in evolutionary algorithms (EAs) since the usual search o...
Abslracl-This paper proposes a framework for automati-cally evolving constraint satisfaction algorit...
We briefly review previous attempts to generate near-optimal solutions of the Traveling Salesman Pro...
We investigate the variable performance of a genetic algorithm (GA) on randomly generated binary con...
The efficient choice of a preprocessing level can reduce the search time of a constraint solver to f...
Constraint satisfaction plays an important role in theoretical and applied computer science. Constra...
We present ULSA, a novel stochastic local search algorithm for random binary constraint satisfaction...
textabstractWe present a study on the difficulty of solving binary constraint satisfaction problems ...
In this paper, genetic algorithms for the unconstrained binary quadratic programming problem (BQP) a...
AbstractThe most common application of genetic algorithms to combinatorial optimization problems has...
This paper introduces a genetic local search algorithm for bi-nary constraint satisfaction problems....
SIGLEAvailable from British Library Document Supply Centre- DSC:9109.3968(EU-DCS-CSM--139) / BLDSC -...
The genetic algorithms (GAs) can be used as a global optimization tool for continuous and discrete f...
Contains fulltext : 84511.pdf (preprint version ) (Open Access)the 2000 Congress o...
Contains fulltext : 84503.pdf (author's version ) (Open Access)5th International C...
Constraint handling is not straightforward in evolutionary algorithms (EAs) since the usual search o...
Abslracl-This paper proposes a framework for automati-cally evolving constraint satisfaction algorit...
We briefly review previous attempts to generate near-optimal solutions of the Traveling Salesman Pro...
We investigate the variable performance of a genetic algorithm (GA) on randomly generated binary con...
The efficient choice of a preprocessing level can reduce the search time of a constraint solver to f...
Constraint satisfaction plays an important role in theoretical and applied computer science. Constra...
We present ULSA, a novel stochastic local search algorithm for random binary constraint satisfaction...
textabstractWe present a study on the difficulty of solving binary constraint satisfaction problems ...
In this paper, genetic algorithms for the unconstrained binary quadratic programming problem (BQP) a...
AbstractThe most common application of genetic algorithms to combinatorial optimization problems has...
DOI
Add to ORKG