{"id":"https://openalex.org/W1991068820","doi":"https://doi.org/10.1080/1055678021000090033","title":"Randomized heuristics for the Max-Cut problem","display_name":"Randomized heuristics for the Max-Cut problem","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1991068820","doi":"https://doi.org/10.1080/1055678021000090033","mag":"1991068820"},"language":"en","primary_location":{"id":"doi:10.1080/1055678021000090033","is_oa":false,"landing_page_url":"https://doi.org/10.1080/1055678021000090033","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-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/A5090584718","display_name":"Paola Festa","orcid":"https://orcid.org/0000-0002-2243-6054"},"institutions":[{"id":"https://openalex.org/I4210117450","display_name":"Federico II University Hospital","ror":"https://ror.org/02jr6tp70","country_code":"IT","type":"healthcare","lineage":["https://openalex.org/I4210117450","https://openalex.org/I71267560"]},{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"P. Festa","raw_affiliation_strings":["\n                   \n               University of Napoli FEDERICO II, Napoli, Italy","University of Napoli FEDERICO II, Napoli, Italy"],"affiliations":[{"raw_affiliation_string":"\n                   \n               University of Napoli FEDERICO II, Napoli, Italy","institution_ids":["https://openalex.org/I71267560","https://openalex.org/I4210117450"]},{"raw_affiliation_string":"University of Napoli FEDERICO II, Napoli, Italy","institution_ids":["https://openalex.org/I71267560"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112552551","display_name":"P. M. Pardalos","orcid":null},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P.M. Pardalos","raw_affiliation_strings":["\n                   \n               University of Florida, Gainesville, FL, USA","University of Florida, Gainesville, FL, USA"],"affiliations":[{"raw_affiliation_string":"\n                   \n               University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029261812","display_name":"Maur\u00edcio G. C. Resende","orcid":"https://orcid.org/0000-0001-7462-6207"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]},{"id":"https://openalex.org/I4210098935","display_name":"Li Creative Technologies (United States)","ror":"https://ror.org/010hpfk35","country_code":"US","type":"company","lineage":["https://openalex.org/I4210098935"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.G.C. Resende","raw_affiliation_strings":["\n                   \n               AT & T Labs Research, 180 Park Avenue, Room C-241, Florham Park, NJ, 07932, USA","AT & T Labs Research, 180 Park Avenue, Room C-241, Florham Park, NJ, 07932, USA"],"affiliations":[{"raw_affiliation_string":"\n                   \n               AT & T Labs Research, 180 Park Avenue, Room C-241, Florham Park, NJ, 07932, USA","institution_ids":["https://openalex.org/I4210098935"]},{"raw_affiliation_string":"AT & T Labs Research, 180 Park Avenue, Room C-241, Florham Park, NJ, 07932, USA","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032142322","display_name":"Celso C. Ribeiro","orcid":"https://orcid.org/0000-0002-9478-2351"},"institutions":[{"id":"https://openalex.org/I2699952","display_name":"Pontifical Catholic University of Rio de Janeiro","ror":"https://ror.org/01dg47b60","country_code":"BR","type":"education","lineage":["https://openalex.org/I2699952"]},{"id":"https://openalex.org/I24871856","display_name":"Universidade Cat\u00f3lica de Bras\u00edlia","ror":"https://ror.org/0058wy590","country_code":"BR","type":"education","lineage":["https://openalex.org/I24871856"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"C.C. Ribeiro","raw_affiliation_strings":["\n                   \n               Catholic University of Rio de Janeiro, Brazil","Catholic University of Rio de Janeiro, Brazil"],"affiliations":[{"raw_affiliation_string":"\n                   \n               Catholic University of Rio de Janeiro, Brazil","institution_ids":["https://openalex.org/I2699952","https://openalex.org/I24871856"]},{"raw_affiliation_string":"Catholic University of Rio de Janeiro, Brazil","institution_ids":["https://openalex.org/I2699952"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5090584718"],"corresponding_institution_ids":["https://openalex.org/I4210117450","https://openalex.org/I71267560"],"apc_list":null,"apc_paid":null,"fwci":12.3568,"has_fulltext":false,"cited_by_count":227,"citation_normalized_percentile":{"value":0.98822551,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"17","issue":"6","first_page":"1033","last_page":"1058"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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.9987999796867371,"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/heuristics","display_name":"Heuristics","score":0.8032857775688171},{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.7743451595306396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7282561659812927},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.573359489440918},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.559686541557312},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.5547448992729187},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.5407646894454956},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5190006494522095},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48419836163520813},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4666818082332611},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43589073419570923},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4215320646762848},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39594021439552307},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37735849618911743},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3327379822731018},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.3264947533607483},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.26169174909591675},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21819168329238892}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8032857775688171},{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.7743451595306396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7282561659812927},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.573359489440918},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.559686541557312},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.5547448992729187},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.5407646894454956},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5190006494522095},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48419836163520813},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4666818082332611},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43589073419570923},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4215320646762848},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39594021439552307},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37735849618911743},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3327379822731018},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3264947533607483},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.26169174909591675},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21819168329238892},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/1055678021000090033","is_oa":false,"landing_page_url":"https://doi.org/10.1080/1055678021000090033","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.9810","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.9810","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/~mgcr/doc/gmaxcut.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W179940750","https://openalex.org/W1486115220","https://openalex.org/W1536573229","https://openalex.org/W1550404336","https://openalex.org/W1562622397","https://openalex.org/W1563351955","https://openalex.org/W1582417773","https://openalex.org/W1587861032","https://openalex.org/W1967781705","https://openalex.org/W1975442866","https://openalex.org/W1985123706","https://openalex.org/W1991107961","https://openalex.org/W2000602248","https://openalex.org/W2007068104","https://openalex.org/W2010334716","https://openalex.org/W2028438572","https://openalex.org/W2036562274","https://openalex.org/W2048822735","https://openalex.org/W2051306216","https://openalex.org/W2051598459","https://openalex.org/W2061607408","https://openalex.org/W2063193808","https://openalex.org/W2078289947","https://openalex.org/W2079641336","https://openalex.org/W2090275183","https://openalex.org/W2094671757","https://openalex.org/W2099861483","https://openalex.org/W2109293843","https://openalex.org/W2141923701","https://openalex.org/W2150683370","https://openalex.org/W2153446897","https://openalex.org/W2159739530","https://openalex.org/W2164824749","https://openalex.org/W2166210809","https://openalex.org/W2339500526","https://openalex.org/W2401610261","https://openalex.org/W2500747461","https://openalex.org/W2912475851","https://openalex.org/W2997776631","https://openalex.org/W4210953350","https://openalex.org/W4212899374","https://openalex.org/W4250845939"],"related_works":["https://openalex.org/W1757657959","https://openalex.org/W3037466935","https://openalex.org/W1533846201","https://openalex.org/W2269669929","https://openalex.org/W3121358922","https://openalex.org/W2089811144","https://openalex.org/W2556917708","https://openalex.org/W1991068820","https://openalex.org/W2135475768","https://openalex.org/W2464498505"],"abstract_inverted_index":{"Given":[0],"an":[1],"undirected":[2],"graph":[3],"with":[4],"edge":[5],"weights,":[6],"the":[7,16,23,26,29],"MAX-CUT":[8],"problem":[9],"consists":[10],"in":[11,33],"finding":[12],"a":[13],"partition":[14],"of":[15,25,28],"nodes":[17],"into":[18],"two":[19],"subsets,":[20],"such":[21],"that":[22],"sum":[24],"weights":[27],"edges":[30],"having":[31],"endpoints":[32],"different":[34],"subsets":[35],"is":[36],"maximized.":[37]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":22},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":16},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":16}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}