{"id":"https://openalex.org/W4281902464","doi":"https://doi.org/10.48550/arxiv.2205.14345","title":"Reinforcement Learning for Branch-and-Bound Optimisation using Retrospective Trajectories","display_name":"Reinforcement Learning for Branch-and-Bound Optimisation using Retrospective Trajectories","publication_year":2022,"publication_date":"2022-05-28","ids":{"openalex":"https://openalex.org/W4281902464","doi":"https://doi.org/10.48550/arxiv.2205.14345"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2205.14345","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2205.14345","pdf_url":"https://arxiv.org/pdf/2205.14345","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":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2205.14345","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008149746","display_name":"Christopher W. F. Parsonson","orcid":"https://orcid.org/0000-0002-2366-7081"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Parsonson, Christopher W. F.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","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":[],"affiliations":[]},{"author_position":"last","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":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008149746"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9919000267982483,"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.9919000267982483,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9830999970436096,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.982200026512146,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/heuristics","display_name":"Heuristics","score":0.8197495937347412},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.753200113773346},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6426022052764893},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.5520421266555786},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5364212989807129},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5282023549079895},{"id":"https://openalex.org/keywords/observability","display_name":"Observability","score":0.5276970863342285},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5126628279685974},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.47079363465309143},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45784538984298706},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41898176074028015},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2996074855327606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29648175835609436},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2536349296569824}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8197495937347412},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.753200113773346},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6426022052764893},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.5520421266555786},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5364212989807129},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5282023549079895},{"id":"https://openalex.org/C36299963","wikidata":"https://www.wikidata.org/wiki/Q1369844","display_name":"Observability","level":2,"score":0.5276970863342285},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5126628279685974},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.47079363465309143},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45784538984298706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41898176074028015},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2996074855327606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29648175835609436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2536349296569824},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2205.14345","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2205.14345","pdf_url":"https://arxiv.org/pdf/2205.14345","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":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2205.14345","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2205.14345","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":"article-journal"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2205.14345","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2205.14345","pdf_url":"https://arxiv.org/pdf/2205.14345","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":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2165085685","https://openalex.org/W2741597579","https://openalex.org/W1978745934","https://openalex.org/W2366206435","https://openalex.org/W2277678953","https://openalex.org/W2170283190","https://openalex.org/W3006406045","https://openalex.org/W2542523353","https://openalex.org/W4248516644","https://openalex.org/W2108334735"],"abstract_inverted_index":{"Combinatorial":[0],"optimisation":[1],"problems":[2],"framed":[3],"as":[4,47,63,87],"mixed":[5],"integer":[6],"linear":[7],"programmes":[8],"(MILPs)":[9],"are":[10,213],"ubiquitous":[11],"across":[12],"a":[13,29,64,124,145],"range":[14],"of":[15,32,50,109,191],"real-world":[16],"applications.":[17],"The":[18],"canonical":[19],"branch-and-bound":[20],"algorithm":[21,184],"seeks":[22],"to":[23,54,74,95,129,151,215],"exactly":[24],"solve":[25],"MILPs":[26,198],"by":[27,185],"constructing":[28],"search":[30,137],"tree":[31,138],"increasingly":[33],"constrained":[34],"sub-problems.":[35],"In":[36,117,161],"practice,":[37],"its":[38],"solving":[39],"time":[40],"performance":[41,196],"is":[42],"dependent":[43],"on":[44,163,197],"heuristics,":[45],"such":[46],"the":[48,51,107,136,149,179,192],"choice":[49],"next":[52,159],"variable":[53],"constrain":[55],"('branching').":[56],"Recently,":[57],"machine":[58],"learning":[59,77,103],"(ML)":[60],"has":[61],"emerged":[62],"promising":[65],"paradigm":[66],"for":[67,131],"branching.":[68,132],"However,":[69],"prior":[70],"works":[71],"have":[72],"struggled":[73],"apply":[75],"reinforcement":[76],"(RL),":[78],"citing":[79],"sparse":[80],"rewards,":[81],"difficult":[82],"exploration,":[83],"and":[84,112,187,202],"partial":[85],"observability":[86],"significant":[88],"challenges.":[89],"Instead,":[90],"leading":[91],"ML":[92],"methodologies":[93],"resort":[94],"approximating":[96],"high":[97],"quality":[98],"handcrafted":[99],"heuristics":[100],"with":[101,156,199,205],"imitation":[102],"(IL),":[104],"which":[105],"precludes":[106],"discovery":[108],"novel":[110],"policies":[111],"requires":[113],"expensive":[114],"data":[115],"labelling.":[116],"this":[118],"work,":[119],"we":[120,147],"propose":[121],"retro":[122],"branching;":[123],"simple":[125],"yet":[126],"effective":[127],"approach":[128,168],"RL":[130,182],"By":[133],"retrospectively":[134,210],"deconstructing":[135],"into":[139],"multiple":[140],"paths":[141],"each":[142],"contained":[143],"within":[144,189],"sub-tree,":[146],"enable":[148],"agent":[150],"learn":[152],"from":[153],"shorter":[154],"trajectories":[155,212],"more":[157],"predictable":[158],"states.":[160],"experiments":[162],"four":[164],"combinatorial":[165],"tasks,":[166],"our":[167,209],"enables":[169],"learning-to-branch":[170],"without":[171],"any":[172],"expert":[173],"guidance":[174],"or":[175],"pre-training.":[176],"We":[177],"outperform":[178],"current":[180],"state-of-the-art":[181],"branching":[183],"3-5x":[186],"come":[188],"20%":[190],"best":[193],"IL":[194],"method's":[195],"500":[200],"constraints":[201],"1000":[203],"variables,":[204],"ablations":[206],"verifying":[207],"that":[208],"constructed":[211],"essential":[214],"achieving":[216],"these":[217],"results.":[218]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}
