Multivalued Neural Network for Graph Maxcut Problem

Neural networks
Combinatorial optimization
Authors

Enrique Mérida Casermeiro

Domingo López-Rodríguez

Published

1 September 2004

Publication details

International Congress of Computational Methods in Science and Engineering 2004

Links

 

Abstract

In this paper we have used a multivalued neural model (MREM) in order to solve the maximum cut problem. A new technique, based in the problem, that allows to escape of certain bad local minima has been incorporated in order to improve the goodness of the obtained solutions. Finally, we have made some comparisons with other neural formulations for that problem obtaining better solutions in a reasonable time.

Cites

The following graph plots the number of cites received by this work from its publication, on a yearly basis.

Citation

Please, cite this work as:

[ML19] E. Mérida-Casermeiro and D. López-Rodríguez. “Multivalued neural network for graph maxcut problem”. In: International Conference of Computational Methods in Sciences and Engineering 2004 (ICCMSE 2004). CRC Press. 2019, pp. 375-378.

@inproceedings{merida2019multivalued,
     title={Multivalued neural network for graph maxcut problem},
     author={Mérida-Casermeiro, E and López-Rodríguez, D},
     booktitle={International Conference of Computational Methods in Sciences and Engineering 2004 (ICCMSE 2004)},
     pages={375–378},
     year={2019},
     organization={CRC Press}
}