{"id":"https://openalex.org/W2051598459","doi":"https://doi.org/10.1137/s1052623400382467","title":"Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs","display_name":"Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2051598459","doi":"https://doi.org/10.1137/s1052623400382467","mag":"2051598459"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623400382467","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623400382467","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5002663715","display_name":"Samuel Burer","orcid":"https://orcid.org/0000-0001-5886-458X"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samuel Burer","raw_affiliation_strings":["[Georgia Institute of Technology.]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Georgia Institute of Technology.]","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108765688","display_name":"Renato D. C. Monteiro","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Renato D. C. Monteiro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5002416203","display_name":"Yin Zhang","orcid":"https://orcid.org/0000-0002-6127-7535"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yin Zhang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.1831,"has_fulltext":false,"cited_by_count":221,"citation_normalized_percentile":{"value":0.98258706,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"12","issue":"2","first_page":"503","last_page":"521"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9969000220298767,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7310718894004822},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7292180061340332},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6055523753166199},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5297618508338928},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5066326260566711},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5024707317352295},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.49384790658950806},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.48249340057373047},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.47128716111183167},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4698661267757416},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4446547329425812},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.43967920541763306},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42387089133262634},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4059251546859741},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3256470561027527},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3208223581314087},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2370460331439972}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7310718894004822},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7292180061340332},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6055523753166199},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5297618508338928},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5066326260566711},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5024707317352295},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.49384790658950806},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.48249340057373047},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.47128716111183167},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4698661267757416},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4446547329425812},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.43967920541763306},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42387089133262634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4059251546859741},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3256470561027527},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3208223581314087},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2370460331439972},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1137/s1052623400382467","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623400382467","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.22.2089","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.2089","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.caam.rice.edu/~zhang/reports/tr0033-rev.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.26.7752","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.7752","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sburer.home.mindspring.com/paper6.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.27.1648","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.1648","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sburer.home.mindspring.com/paper6.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.32.6044","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.6044","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.caam.rice.edu/~zhang/reports/tr0033.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.367.7462","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.7462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.caam.rice.edu/~zhang/reports/tr0033-rev.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.91.7985","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.7985","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dollar.biz.uiowa.edu/~burer/papers/005-rank2maxcut.pdf","raw_type":"text"},{"id":"pmh:oai:scholarship.rice.edu:1911/101959","is_oa":false,"landing_page_url":"http://hdl.handle.net/1911/101959","pdf_url":null,"source":{"id":"https://openalex.org/S4306401268","display_name":"Rice Digital Scholarship Archive (Rice University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74775410","host_organization_name":"Rice University","host_organization_lineage":["https://openalex.org/I74775410"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Technical report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W133315654","https://openalex.org/W291625388","https://openalex.org/W1487348423","https://openalex.org/W1494985256","https://openalex.org/W1601503375","https://openalex.org/W1973320566","https://openalex.org/W1985123706","https://openalex.org/W1985476702","https://openalex.org/W2000449275","https://openalex.org/W2000602248","https://openalex.org/W2007068104","https://openalex.org/W2024457515","https://openalex.org/W2036562274","https://openalex.org/W2051306216","https://openalex.org/W2059944299","https://openalex.org/W2061607408","https://openalex.org/W2071143636","https://openalex.org/W2071563913","https://openalex.org/W2078289947","https://openalex.org/W2079751294","https://openalex.org/W2082603400","https://openalex.org/W2085595139","https://openalex.org/W2092812429","https://openalex.org/W2106264302","https://openalex.org/W2164948865","https://openalex.org/W4236318857","https://openalex.org/W4242858928","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2352839224","https://openalex.org/W2371590971","https://openalex.org/W2203098598","https://openalex.org/W1653317167","https://openalex.org/W1989828432","https://openalex.org/W2107689258","https://openalex.org/W2593080689","https://openalex.org/W1991979416","https://openalex.org/W2024017812","https://openalex.org/W4205854323"],"abstract_inverted_index":{"The":[0,59],"Goemans--Williamson":[1,57,102,148,169],"randomized":[2,103,149],"algorithm":[3],"guarantees":[4],"a":[5,52,109,116,138],"high-quality":[6],"approximation":[7,19,140],"to":[8,28,39,63,68,153],"the":[9,13,29,56,79,87,101,127,147,164,168,173,183],"MAX-CUT":[10,69,118,184],"problem,":[11],"but":[12],"cost":[14],"associated":[15],"with":[16,93,108],"such":[17],"an":[18,33,46,160,179],"can":[20],"be":[21],"excessively":[22],"high":[23],"for":[24,31,77,113],"large-scale":[25],"problems":[26],"due":[27],"need":[30],"solving":[32,115],"expensive":[34],"semidefinite":[35,96],"relaxation.":[36],"In":[37],"order":[38],"achieve":[40],"better":[41],"practical":[42],"performance,":[43],"we":[44],"propose":[45],"alternative,":[47],"rank-two":[48,88],"relaxation":[49,89],"and":[50,132,167],"develop":[51],"specialized":[53],"version":[54],"of":[55,146],"technique.":[58],"proposed":[60,128,165],"approach":[61,129,166,175],"leads":[62],"continuous":[64],"optimization":[65],"heuristics":[66,90],"applicable":[67],"as":[70,72,105,107,158],"well":[71,106],"other":[73],"binary":[74],"quadratic":[75],"programs,":[76],"example":[78],"MAX-BISECTION":[80,154],"problem.":[81],"A":[82],"computer":[83],"code":[84,112],"based":[85],"on":[86,182],"is":[91,130,155,159],"compared":[92],"two":[94],"state-of-the-art":[95],"programming":[97],"codes":[98],"that":[99,126,145,172],"implement":[100],"algorithm,":[104],"purely":[110],"heuristic":[111],"effectively":[114],"particular":[117],"problem":[119],"arising":[120],"in":[121,142],"physics.":[122],"Computational":[123],"results":[124],"show":[125],"fast":[131],"scalable":[133],"and,":[134],"more":[135],"importantly,":[136],"attains":[137],"higher":[139],"quality":[141],"practice":[143],"than":[144],"algorithm.":[150],"An":[151],"extension":[152],"also":[156],"discussed,":[157],"important":[161],"difference":[162],"between":[163],"algorithm;":[170],"namely,":[171],"new":[174],"does":[176],"not":[177],"guarantee":[178],"upper":[180],"bound":[181],"optimal":[185],"value.":[186]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":16},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":18},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":18}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}