{"id":"https://openalex.org/W2397676340","doi":"https://doi.org/10.1201/9781351236423-35","title":"A Development and Deployment Framework for Distributed Branch-and-Bound","display_name":"A Development and Deployment Framework for Distributed Branch-and-Bound","publication_year":2018,"publication_date":"2018-05-15","ids":{"openalex":"https://openalex.org/W2397676340","doi":"https://doi.org/10.1201/9781351236423-35","mag":"2397676340"},"language":"en","primary_location":{"id":"doi:10.1201/9781351236423-35","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781351236423-35","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Approximation Algorithms and Metaheuristics, Second Edition","raw_type":"book-chapter"},"type":"book-chapter","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/A5048690917","display_name":"P. Cappello","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Peter Cappello","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5022639509","display_name":"Christopher James Coakley","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christopher James Coakley","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048690917"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00190272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"629","last_page":"640"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/T12288","display_name":"Optimization and Search Problems","score":0.9801999926567078,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.955299973487854,"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/software-deployment","display_name":"Software deployment","score":0.8147177696228027},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5750026702880859},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.47197848558425903},{"id":"https://openalex.org/keywords/development","display_name":"Development (topology)","score":0.42231523990631104},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3650297522544861},{"id":"https://openalex.org/keywords/software-engineering","display_name":"Software engineering","score":0.13392740488052368},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09077000617980957},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.07776027917861938}],"concepts":[{"id":"https://openalex.org/C105339364","wikidata":"https://www.wikidata.org/wiki/Q2297740","display_name":"Software deployment","level":2,"score":0.8147177696228027},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5750026702880859},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.47197848558425903},{"id":"https://openalex.org/C2776542497","wikidata":"https://www.wikidata.org/wiki/Q5266672","display_name":"Development (topology)","level":2,"score":0.42231523990631104},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3650297522544861},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.13392740488052368},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09077000617980957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.07776027917861938},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1201/9781351236423-35","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781351236423-35","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Approximation Algorithms and Metaheuristics, Second Edition","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W80908190","https://openalex.org/W1838201663","https://openalex.org/W1893991730","https://openalex.org/W1963620884","https://openalex.org/W2005933636","https://openalex.org/W2042192317","https://openalex.org/W2046363474","https://openalex.org/W2053913299","https://openalex.org/W2082897183","https://openalex.org/W2091364465","https://openalex.org/W2098436521","https://openalex.org/W2104861744","https://openalex.org/W2105120828","https://openalex.org/W2106463930","https://openalex.org/W2111340560","https://openalex.org/W2115367137","https://openalex.org/W2118447814","https://openalex.org/W2123241324","https://openalex.org/W2130970357","https://openalex.org/W2136315902","https://openalex.org/W2156424550","https://openalex.org/W2159104514","https://openalex.org/W2160949816","https://openalex.org/W2167287107","https://openalex.org/W2173994910","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W96612179","https://openalex.org/W2566006169","https://openalex.org/W2770234245","https://openalex.org/W2987774938","https://openalex.org/W632915154","https://openalex.org/W4229499248","https://openalex.org/W4378874356","https://openalex.org/W2369811061"],"abstract_inverted_index":{"Branch-and-bound":[0,13],"intelligently":[1],"searches":[2],"the":[3,99,105,110,114,119,129],"set":[4,89],"of":[5,31,45,90,108,131],"feasible":[6],"solutions":[7],"to":[8,19,84,102],"a":[9,36,43,87,138],"combinatorial":[10],"optimization":[11],"problem.":[12],"algorithms":[14],"may":[15],"be":[16,50],"easily":[17],"modified":[18],"generate":[20],"suboptimal":[21],"solutions.":[22],"The":[23,96],"branch-and-bound":[24,56,70],"computation":[25],"is":[26,33,77,146],"decomposed":[27],"into":[28],"tasks,":[29],"each":[30],"which":[32],"executed":[34],"on":[35,47,86,104,128],"computer":[37],"server.":[38],"There":[39],"also":[40],"has":[41],"been":[42],"lot":[44],"work":[46],"what":[48],"might":[49],"called":[51],"programming":[52],"frameworks":[53],"for":[54,66],"distributed":[55,67],"computation.":[57],"M.":[58],"O.":[59],"Neary":[60],"et":[61],"al.":[62],"present":[63],"an":[64],"infrastructure/framework":[65],"computing,":[68],"including":[69],"that":[71,145],"tolerates":[72],"faulty":[73],"compute":[74],"servers,":[75],"and":[76,93,118,124,140],"in":[78],"pure":[79],"Java":[80],"allowing":[81],"application":[82,100],"codes":[83],"run":[85],"heterogeneous":[88],"machine":[91],"types":[92],"operating":[94],"systems.":[95],"framework":[97],"allows":[98],"developer":[101],"focus":[103],"problem-specific":[106],"aspects":[107],"branch-and-bound:":[109],"lower":[111],"bound":[112,116],"computation,":[113,117],"upper":[115],"branching":[120],"rule.":[121],"A.":[122],"Iamnitchi":[123],"I.":[125],"Foster":[126],"build":[127],"idea":[130],"exploiting":[132],"branch-and-bound's":[133],"tree-structured":[134],"search":[135],"space,":[136],"producing":[137],"branch":[139],"bound-specific":[141],"fault":[142],"tolerance":[143],"scheme":[144],"distributed,":[147],"although":[148],"they":[149],"provide":[150],"only":[151],"simulation":[152],"results.":[153]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}