{"id":"https://openalex.org/W2037115918","doi":"https://doi.org/10.1109/icnc.2012.6234769","title":"A PROBE-based algorithm for the max-cut problem","display_name":"A PROBE-based algorithm for the max-cut problem","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W2037115918","doi":"https://doi.org/10.1109/icnc.2012.6234769","mag":"2037115918"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2012.6234769","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234769","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075403730","display_name":"Geng Lin","orcid":"https://orcid.org/0000-0002-1643-6859"},"institutions":[{"id":"https://openalex.org/I354108","display_name":"Minjiang University","ror":"https://ror.org/00s7tkw17","country_code":"CN","type":"education","lineage":["https://openalex.org/I354108"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Geng Lin","raw_affiliation_strings":["Department of Mathematics, Minjiang University, Fuzhou, China","Department of Mathematics, Minjiang University, Fuzhou 350108, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Minjiang University, Fuzhou, China","institution_ids":["https://openalex.org/I354108"]},{"raw_affiliation_string":"Department of Mathematics, Minjiang University, Fuzhou 350108, China","institution_ids":["https://openalex.org/I354108"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5075403730"],"corresponding_institution_ids":["https://openalex.org/I354108"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09562689,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":null,"first_page":"627","last_page":"630"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9990000128746033,"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.9990000128746033,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9977999925613403,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.7631857395172119},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6697292327880859},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6140649914741516},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5432987213134766},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5374006032943726},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5074474215507507},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48133882880210876},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4628324806690216},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4379669427871704},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4369962513446808},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.42234525084495544},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.4198005795478821},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33797043561935425},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.17893469333648682},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.165929913520813}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7631857395172119},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6697292327880859},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6140649914741516},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5432987213134766},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5374006032943726},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5074474215507507},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48133882880210876},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4628324806690216},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4379669427871704},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4369962513446808},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.42234525084495544},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.4198005795478821},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33797043561935425},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.17893469333648682},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.165929913520813},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2012.6234769","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234769","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W155769578","https://openalex.org/W291625388","https://openalex.org/W1965219960","https://openalex.org/W1976523866","https://openalex.org/W1985123706","https://openalex.org/W1991068820","https://openalex.org/W2003719432","https://openalex.org/W2051306216","https://openalex.org/W2051598459","https://openalex.org/W2063903854","https://openalex.org/W2086917808","https://openalex.org/W2094671757","https://openalex.org/W2095117703","https://openalex.org/W2117271622","https://openalex.org/W2141923701","https://openalex.org/W2159739530","https://openalex.org/W2401610261","https://openalex.org/W3149807546","https://openalex.org/W4236269389","https://openalex.org/W4238018361"],"related_works":["https://openalex.org/W2014637163","https://openalex.org/W187767610","https://openalex.org/W2597689725","https://openalex.org/W2592065458","https://openalex.org/W4210470436","https://openalex.org/W2146364482","https://openalex.org/W1988621216","https://openalex.org/W1981626956","https://openalex.org/W2156087782","https://openalex.org/W2171591902"],"abstract_inverted_index":{"The":[0,71],"max-cut":[1,29],"problem":[2],"is":[3,33,46,54,81],"a":[4,12,20,36,41],"classical":[5],"combinatorial":[6],"optimization":[7],"problem.":[8,30],"This":[9],"paper":[10],"uses":[11],"Population":[13],"Reinforced":[14],"Optimization":[15],"Based":[16],"Exploration":[17],"(PROBE)":[18],"as":[19],"framework":[21],"for":[22,26,83],"developing":[23],"metaheuristic":[24],"algorithm":[25,80],"solving":[27],"the":[28,49,58,69,78],"A":[31],"solution":[32],"constructed":[34],"by":[35],"greedy":[37],"construction":[38],"method,":[39],"then":[40],"local":[42],"search":[43],"procedure,":[44],"which":[45],"based":[47],"on":[48,64],"Fiduccia":[50],"and":[51,74],"Mattheyses":[52],"heuristic,":[53],"used":[55],"to":[56],"improve":[57],"solution.":[59],"Experimental":[60],"tests":[61],"are":[62],"done":[63],"some":[65],"instances":[66],"taken":[67],"from":[68],"literature.":[70],"experiment":[72],"results":[73],"comparisons":[75],"show":[76],"that":[77],"proposed":[79],"efficient":[82],"these":[84],"tested":[85],"benchmarks.":[86]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}