{"id":"https://openalex.org/W2974234031","doi":"https://doi.org/10.1109/coase.2019.8842982","title":"Integrating Heuristics and Approximations into a Branch and Bound Framework","display_name":"Integrating Heuristics and Approximations into a Branch and Bound Framework","publication_year":2019,"publication_date":"2019-08-01","ids":{"openalex":"https://openalex.org/W2974234031","doi":"https://doi.org/10.1109/coase.2019.8842982","mag":"2974234031"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2019.8842982","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2019.8842982","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","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/A5056796690","display_name":"Zelda B. Zabinsky","orcid":"https://orcid.org/0000-0003-1838-4981"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zelda B. Zabinsky","raw_affiliation_strings":["Department of Industrial and Systems Engineering, University of Washington, Seattle, WA, 98195-2650, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, University of Washington, Seattle, WA, 98195-2650, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056821570","display_name":"Ting-Yu Ho","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ting-Yu Ho","raw_affiliation_strings":["Department of Industrial and Systems Engineering, University of Washington, Seattle, WA, 98195-2650, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, University of Washington, Seattle, WA, 98195-2650, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101956431","display_name":"Hao Huang","orcid":"https://orcid.org/0000-0002-0148-5172"},"institutions":[{"id":"https://openalex.org/I99908691","display_name":"Yuan Ze University","ror":"https://ror.org/01fv1ds98","country_code":"TW","type":"education","lineage":["https://openalex.org/I99908691"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Hao Huang","raw_affiliation_strings":["Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan, Taiwan","institution_ids":["https://openalex.org/I99908691"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056796690"],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":0.4351,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.71196694,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"774","last_page":"779"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9929999709129333,"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/T11195","display_name":"Simulation Techniques and Applications","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8696831464767456},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6560641527175903},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6372829675674438},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46283435821533203},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4335525929927826},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3335672616958618},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2454087734222412},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21116352081298828}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8696831464767456},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6560641527175903},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6372829675674438},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46283435821533203},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4335525929927826},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3335672616958618},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2454087734222412},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21116352081298828}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coase.2019.8842982","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2019.8842982","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W600148761","https://openalex.org/W1486454173","https://openalex.org/W1556745949","https://openalex.org/W1569990960","https://openalex.org/W1570584007","https://openalex.org/W1601081659","https://openalex.org/W1992382037","https://openalex.org/W2027968610","https://openalex.org/W2041714725","https://openalex.org/W2044877509","https://openalex.org/W2058985100","https://openalex.org/W2133854849","https://openalex.org/W2572688165","https://openalex.org/W2586954579","https://openalex.org/W2592893595","https://openalex.org/W2891138961","https://openalex.org/W2914076357","https://openalex.org/W2948016058","https://openalex.org/W2972956988","https://openalex.org/W2979648405","https://openalex.org/W4231129290","https://openalex.org/W4248472947","https://openalex.org/W4251787714","https://openalex.org/W4252801674","https://openalex.org/W6768218733"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W1690653314","https://openalex.org/W2401723157","https://openalex.org/W2065055572","https://openalex.org/W2784269775","https://openalex.org/W2209011256"],"abstract_inverted_index":{"Algorithms":[0],"for":[1],"solving":[2],"large-scale":[3],"optimization":[4],"problems":[5,225],"often":[6,19],"use":[7,183],"heuristics":[8,33,185],"and":[9,34,39,64,94,114,133,137,146,186,194,214],"approximations":[10,35,187],"to":[11,25,42,54,97,130,156,167,188,216],"achieve":[12],"a":[13,37,47,79,92,99,111,135,143,152,165,190],"solution":[14,48,192,203],"quickly,":[15,49,193],"however":[16],"there":[17],"is":[18,125],"little":[20],"or":[21],"no":[22],"information":[23,197],"as":[24,124],"the":[26,29,52,172,199,202,220],"quality":[27,200],"of":[28,45,171,184,201,222],"solution.":[30],"We":[31],"integrate":[32],"into":[36,73,91,164],"branch":[38,93,136],"bound":[40,95,138],"framework":[41,53,96],"take":[43],"advantage":[44],"obtaining":[46],"while":[50],"using":[51],"prune":[55,134,169],"regions":[56,170],"that":[57,85,118,150,161,181],"do":[58],"not":[59],"contain":[60],"an":[61,66,87,120,206],"optimal":[62],"solution,":[63],"provide":[65,196],"optimality":[67,207],"gap.":[68,208],"Three":[69],"examples":[70],"are":[71,162,226],"cast":[72],"this":[74],"framework.":[75],"First,":[76],"we":[77,109,141],"describe":[78,110,142],"Rollout":[80],"Algorithm":[81,116],"with":[82],"Branch-and-Bound":[83],"(RA-BnB)":[84],"embeds":[86,119],"approximate":[88],"dynamic":[89],"program":[90],"address":[98],"challenging":[100],"resource":[101],"allocation":[102],"problem":[103],"in":[104,128,219],"population":[105],"disease":[106],"management.":[107],"Second,":[108],"Vehicle":[112],"Routing":[113],"Scheduling":[115],"(VeRSA)":[117],"easily":[121],"calculated":[122],"index,":[123],"commonly":[126],"used":[127],"scheduling,":[129],"dynamically":[131],"search":[132],"tree.":[139,173],"Third,":[140],"Probabilistic":[144],"Branch":[145],"Bound":[147],"algorithm":[148],"(PBnB)":[149],"uses":[151],"statistical":[153],"sampling":[154],"method":[155],"obtain":[157],"confidence":[158],"interval":[159],"bounds":[160],"embedded":[163],"tree":[166],"probabilistically":[168],"These":[174],"three,":[175],"apparently":[176],"different,":[177],"methods":[178],"share":[179],"commonalities":[180],"make":[182],"generate":[189],"\u201cnear-optimal\u201d":[191],"also":[195],"on":[198,211],"by":[204],"providing":[205],"Lessons":[209],"learned":[210],"implementation":[212],"decisions":[213],"how":[215],"balance":[217],"computation":[218],"context":[221],"these":[223],"three":[224],"discussed.":[227]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}