Relaxation Labeling with Learning Automata
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient search techniques—an empirical study of the N-Queens problem
IBM Journal of Research and Development
On the stability of the travelling salesman problem algorithm of Hopfield and Tank
Biological Cybernetics
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Recursive neural networks for associative memory
Recursive neural networks for associative memory
Optimal multiple interval assignments in frequency assignment and traffic phasing
Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
Complex scheduling with Potts neural networks
Neural Computation
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Backtrack programming techniques
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Study of Genetic Search for the Frequency Assignment Problem
AE '95 Selected Papers from the European conference on Artificial Evolution
Group updates and multiscaling: an efficient neural network approach to combinatorial optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A memetic algorithm for the quadratic multiple container packing problem
Applied Intelligence
| Hi-index | 0.00 |
An efficient neural network technique is presented for the solutionof binary constraint satisfaction problems. The method is based onthe application of a double-update technique to the operation of thediscrete Hopfield-type neural network that can be constructed for thesolution of such problems. This operation scheme ensures that thenetwork moves only between consistent states, such that each problemvariable is assigned exactly one value, and leads to a fast andefficient search of the problem state space. Extensions of theproposed method are considered in order to include severaloptimisation criteria in the search. Experimental results concerningmany real-size instances of the Radio Links Frequency AssignmentProblem demonstrate very good performance.