{"id":"https://openalex.org/W4320458516","doi":"https://doi.org/10.48550/arxiv.2205.14105","title":"Learning to Solve Combinatorial Graph Partitioning Problems via Efficient Exploration","display_name":"Learning to Solve Combinatorial Graph Partitioning Problems via Efficient Exploration","publication_year":2022,"publication_date":"2022-05-27","ids":{"openalex":"https://openalex.org/W4320458516","doi":"https://doi.org/10.48550/arxiv.2205.14105"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2205.14105","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2205.14105","pdf_url":"https://arxiv.org/pdf/2205.14105","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2205.14105","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052796575","display_name":"Thomas D. Barrett","orcid":"https://orcid.org/0000-0001-6241-3028"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Barrett, Thomas D.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008149746","display_name":"Christopher W. F. Parsonson","orcid":"https://orcid.org/0000-0002-2366-7081"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Parsonson, Christopher W. F.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5069279442","display_name":"Alexandre Laterre","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Laterre, Alexandre","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":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9857000112533569,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9857000112533569,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9671000242233276,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9569000005722046,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/scalability","display_name":"Scalability","score":0.7234201431274414},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6873041987419128},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.6440298557281494},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4518992602825165},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.44537925720214844},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4021623730659485},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35418152809143066},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3277624249458313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.177261084318161}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7234201431274414},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6873041987419128},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.6440298557281494},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4518992602825165},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44537925720214844},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4021623730659485},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35418152809143066},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3277624249458313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.177261084318161},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2205.14105","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2205.14105","pdf_url":"https://arxiv.org/pdf/2205.14105","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2205.14105","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2205.14105","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2205.14105","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2205.14105","pdf_url":"https://arxiv.org/pdf/2205.14105","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4306904969","https://openalex.org/W2138720691","https://openalex.org/W4362501864","https://openalex.org/W4380318855","https://openalex.org/W2031695474","https://openalex.org/W2389214306","https://openalex.org/W2024136090","https://openalex.org/W2586732548","https://openalex.org/W3049728571","https://openalex.org/W2964765435"],"abstract_inverted_index":{"From":[0],"logistics":[1],"to":[2,28,55,83,125,136,154,159],"the":[3,81,109,126,131],"natural":[4],"sciences,":[5],"combinatorial":[6],"optimisation":[7],"on":[8,58,108,138],"graphs":[9,141,156],"underpins":[10],"numerous":[11],"real-world":[12],"applications.":[13],"Reinforcement":[14],"learning":[15],"(RL)":[16],"has":[17],"shown":[18],"particular":[19],"promise":[20],"in":[21,120],"this":[22,77],"setting":[23],"as":[24],"it":[25],"can":[26],"adapt":[27],"specific":[29],"problem":[30],"structures":[31],"and":[32,122],"does":[33],"not":[34],"require":[35],"pre-solved":[36],"instances":[37],"for":[38,105],"these,":[39],"often":[40],"NP-hard,":[41],"problems.":[42],"However,":[43],"state-of-the-art":[44],"(SOTA)":[45],"approaches":[46],"typically":[47],"suffer":[48],"from":[49],"severe":[50],"scalability":[51],"issues,":[52],"primarily":[53],"due":[54],"their":[56],"reliance":[57],"expensive":[59],"graph":[60],"neural":[61],"networks":[62],"(GNNs)":[63],"at":[64],"each":[65],"decision":[66],"step.":[67],"We":[68],"introduce":[69],"ECORD;":[70],"a":[71,84,90,96,102,143],"novel":[72],"RL":[73,106],"algorithm":[74],"that":[75],"alleviates":[76],"expense":[78],"by":[79,95,134],"restricting":[80],"GNN":[82],"single":[85],"pre-processing":[86],"step,":[87],"before":[88],"entering":[89],"fast-acting":[91],"exploratory":[92],"phase":[93],"directed":[94],"recurrent":[97],"unit.":[98],"Experimentally,":[99],"ECORD":[100,129,148],"achieves":[101],"new":[103],"SOTA":[104],"algorithms":[107],"Maximum":[110],"Cut":[111],"problem,":[112],"whilst":[113],"also":[114],"providing":[115],"orders":[116],"of":[117],"magnitude":[118],"improvement":[119],"speed":[121],"scalability.":[123],"Compared":[124],"nearest":[127],"competitor,":[128],"reduces":[130],"optimality":[132],"gap":[133],"up":[135,158],"73%":[137],"500":[139],"vertex":[140],"with":[142,157],"decreased":[144],"wall-clock":[145],"time.":[146],"Moreover,":[147],"retains":[149],"strong":[150],"performance":[151],"when":[152],"generalising":[153],"larger":[155],"10000":[160],"vertices.":[161]},"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}