{"id":"https://openalex.org/W44390306","doi":null,"title":"An Improved Maximum Neural Network Algorithm for Maximum Cut Problem","display_name":"An Improved Maximum Neural Network Algorithm for Maximum Cut Problem","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W44390306","mag":"44390306"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.498.6025","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.498.6025","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://bsrc.kaist.ac.kr/nip-lr/V10N02/V10N02P2-27-34.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W44390306"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jiahai Wang","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Jiahai Wang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.3905999958515167,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.3905999958515167,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.37720000743865967,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.18529999256134033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-cut-problem","display_name":"max-cut problem","score":0.9919999837875366},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.8209999799728394},{"id":"https://openalex.org/keywords/local-optima-avoidance","display_name":"local optima avoidance","score":0.8650000095367432},{"id":"https://openalex.org/keywords/network-dynamics","display_name":"network dynamics","score":0.6320000290870667},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.953000009059906}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.9324408173561096},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.7505420446395874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6181313991546631},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5938305854797363},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5748192667961121},{"id":"https://openalex.org/C86582703","wikidata":"https://www.wikidata.org/wiki/Q7617824","display_name":"Stochastic neural network","level":4,"score":0.46851846575737},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37276941537857056},{"id":"https://openalex.org/C175202392","wikidata":"https://www.wikidata.org/wiki/Q2434543","display_name":"Time delay neural network","level":3,"score":0.3544928729534149},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31639835238456726},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24676620960235596},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.498.6025","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.498.6025","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://bsrc.kaist.ac.kr/nip-lr/V10N02/V10N02P2-27-34.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W416697387","https://openalex.org/W563881401","https://openalex.org/W612732829","https://openalex.org/W1597286183","https://openalex.org/W1992442093","https://openalex.org/W2004804810","https://openalex.org/W2040997169","https://openalex.org/W2076998221","https://openalex.org/W2128193809","https://openalex.org/W2133671888","https://openalex.org/W2152434857","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W2152434857","https://openalex.org/W1996797249","https://openalex.org/W2071332068","https://openalex.org/W416697387","https://openalex.org/W390875933","https://openalex.org/W1553719322","https://openalex.org/W185005966","https://openalex.org/W1569642472","https://openalex.org/W2956002215","https://openalex.org/W2027212661"],"abstract_inverted_index":{"Abstract":[0],"\u2014":[1],"In":[2],"this":[3],"paper,":[4],"we":[5],"propose":[6],"a":[7,28],"new":[8],"parallel":[9,38],"algorithm":[10,39],"that":[11],"can":[12,47],"help":[13],"the":[14,32,36,49,67],"maximum":[15,23,33],"neural":[16,34],"network":[17,50],"escape":[18],"from":[19,51],"local":[20,55],"minima":[21],"for":[22],"cut":[24],"problem.":[25],"By":[26],"adding":[27],"nonlinear":[29],"self-feedback":[30],"to":[31,65],"network,":[35],"proposed":[37,68],"has":[40],"richer":[41],"and":[42,46],"more":[43],"flexible":[44],"dynamics":[45],"prevent":[48],"getting":[52],"stuck":[53],"at":[54],"minima.":[56],"A":[57],"large":[58],"number":[59],"of":[60],"instances":[61],"have":[62],"been":[63],"simulated":[64],"verify":[66],"algorithm.":[69]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W44390306","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-27T00:00:00"}
