Idioma:

0-1 constraints satisfaction through recursive neural networks with mixed penalties

Herault, L. ; Privault, C.

1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227), 1998, Vol.2, p.1398-1403 vol.2

IEEE

Texto completo disponível

Citações Citado por

Enviar para

Título:
0-1 constraints satisfaction through recursive neural networks with mixed penalties
Autor: Herault, L. ; Privault, C.
Assuntos: Constraint optimization ; Contracts ; Ear ; Energy measurement ; Hopfield neural networks ; Large-scale systems ; Law ; Linear programming ; Linear systems ; Neural networks
É parte de: 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227), 1998, Vol.2, p.1398-1403 vol.2
Descrição: This paper presents a new analog neuron-like network for finding feasible solutions to 0-1 constraints satisfaction problems having potentially several thousand of variables. It is based on mixed-penalty functions: exterior penalty functions together with interior penalty functions. Starting from a near-binary solution satisfying each linear inequality, the network generates trial solutions located outside or inside the feasible set, in order to minimize an energy function which measures the total binary infeasibility of the system. The performances of the network are demonstrated on real data sets from an industrial assignment problem of large size with linear inequalities and binary variables.
Editor: IEEE
Idioma: Inglês

Voltar para lista de resultados

Realização: Logos de Redes Sociais:

0-1 constraints satisfaction through recursive neural networks with mixed penalties

Herault, L. ; Privault, C.

IEEE

Buscando em bases de dados remotas. Favor aguardar.