Modelling competitive Hopfield networks for the maximum clique problem

Literals

• fabio:hasPublicationYear
  • 2003
• dcterms:creator
  • Galán-Marín G.
• dcterms:contributor
  • Galan-Marin, G; Merida-Casermeiro, E; Munoz-Perez, J
• ou:bibtex
  • @article{RID:0708151554221-30, title = {Modelling competitive Hopfield networks for the maximum clique problem}, journal = {Computers & Operations Research}, year = {2003}, author = {Galan-Marin, G and Merida-Casermeiro, E and Munoz-Perez, J}, volume = {30}, number = {4}, pages = {603-624} }
• dcterms:title
  • Modelling competitive Hopfield networks for the maximum clique problem
• vivo:identifier
  • 2003-162
• ou:eid
  • 2-s2.0-0037375225
• bibo:doi
  • 10.1016/s0305-0548(02)00028-x
• bibo:issn
  • 0305-0548
• bibo:page_range
  • 603-624
• dcterms:publisher
  • Computers and Operations Research
• ou:tipoPublicacion
  • Article
• vcard:url
  • https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=0037375225&origin=inward
• ou:urlOrcid
  • http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=ORCID&SrcApp=OrcidOrg&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=WOS:000179778200010&KeyUID=WOS:000179778200010
• ou:urlScopus
  • https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=0037375225&origin=inward
• ou:vecesCitado
  • 31
• bibo:volume
  • 30

Typed Literals

• dcterms:created
  • 2003-04-01T00:00:00 (xsd:dateTime)

Inverse Relations

• Has related: ou:tienePublicacion
  • MARÍA GLORIA GALÁN MARÍN