"Modelling competitive Hopfield networks for the maximum clique problem."

Gloria Galán Marín, Enrique Mérida Casermeiro, José Muñoz-Pérez (2003)

> Home

Details and statistics

DOI: 10.1016/S0305-0548(02)00028-X

access: closed

type: Journal Article

metadata version: 2020-02-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cor/MarinCM03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/MarinCM03
Gloria Galán Marín, Enrique Mérida Casermeiro, José Muñoz-Pérez:
Modelling competitive Hopfield networks for the maximum clique problem. Comput. Oper. Res. 30(4): 603-624 (2003)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.