{"id":"https://openalex.org/W2611328","doi":"https://doi.org/10.1007/0-387-22827-6_5","title":"Parallel Algorithm Design for Branch and Bound","display_name":"Parallel Algorithm Design for Branch and Bound","publication_year":2006,"publication_date":"2006-06-15","ids":{"openalex":"https://openalex.org/W2611328","doi":"https://doi.org/10.1007/0-387-22827-6_5","mag":"2611328"},"language":"en","primary_location":{"id":"doi:10.1007/0-387-22827-6_5","doi":"https://doi.org/10.1007/0-387-22827-6_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/0-387-22827-6_5","pdf_url":null,"source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Series in Operations Research & Management Science","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W4249503917","display_name":"Tutorials on Emerging Methodologies and Applications in Operations Research"},"type":"book-chapter","is_traditional":true,"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/A5076610730","display_name":"David A. Bader","orcid":"https://orcid.org/0000-0002-7380-5876","observed_orcids":["https://orcid.org/0000-0002-7380-5876"]},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David A. Bader","raw_affiliation_strings":["Department of Electrical & Computer Engineering, University of New Mexico, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of New Mexico, USA","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102842741","display_name":"William E. Hart","orcid":"https://orcid.org/0000-0002-6849-2780","observed_orcids":["https://orcid.org/0000-0002-6849-2780"]},"institutions":[{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William E. Hart","raw_affiliation_strings":["Discrete Mathematics and Algorithms Department, Sandia National Laboratories, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Discrete Mathematics and Algorithms Department, Sandia National Laboratories, USA","institution_ids":["https://openalex.org/I4210104735"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035120984","display_name":"Cynthia A. Phillips","orcid":"https://orcid.org/0000-0001-7348-9079","observed_orcids":["https://orcid.org/0000-0001-7348-9079"]},"institutions":[{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cynthia A. Phillips","raw_affiliation_strings":["Discrete Mathematics and Algorithms Department, Sandia National Laboratories, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Discrete Mathematics and Algorithms Department, Sandia National Laboratories, USA","institution_ids":["https://openalex.org/I4210104735"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.403,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.96909765,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"5","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.8622999787330627,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.8622999787330627,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.07829999923706055,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.020500000566244125,"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/parallel-branch-and-bound","display_name":"parallel branch-and-bound","score":0.9100000262260437},{"id":"https://openalex.org/keywords/parallel-optimization","display_name":"parallel optimization","score":0.7099999785423279},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.9629999995231628},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"quadratic assignment problem","score":0.9399999976158142},{"id":"https://openalex.org/keywords/grid-computing","display_name":"grid computing","score":0.7300000190734863},{"id":"https://openalex.org/keywords/distributed-memory-systems","display_name":"distributed memory systems","score":0.722000002861023},{"id":"https://openalex.org/keywords/shared-memory-multiprocessors","display_name":"shared-memory multiprocessors","score":0.9710000157356262},{"id":"https://openalex.org/keywords/parallel-programming-models","display_name":"parallel programming models","score":0.7580000162124634},{"id":"https://openalex.org/keywords/maximum-parsimony","display_name":"maximum parsimony","score":0.902999997138977},{"id":"https://openalex.org/keywords/phylogenetic-tree","display_name":"phylogenetic tree","score":0.8700000047683716}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.774890124797821},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.762319028377533},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6861809492111206},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4648439288139343},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4589115381240845},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.45126795768737793},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.43366876244544983},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3835524916648865},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.3414836525917053},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3148963451385498},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15982460975646973},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/0-387-22827-6_5","doi":"https://doi.org/10.1007/0-387-22827-6_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/0-387-22827-6_5","pdf_url":null,"source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Series in Operations Research & Management Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":109,"referenced_works":["https://openalex.org/W25934612","https://openalex.org/W91513641","https://openalex.org/W92976189","https://openalex.org/W152315924","https://openalex.org/W182750848","https://openalex.org/W277847116","https://openalex.org/W590197378","https://openalex.org/W602132365","https://openalex.org/W1487781539","https://openalex.org/W1489252188","https://openalex.org/W1491097372","https://openalex.org/W1496115176","https://openalex.org/W1503001724","https://openalex.org/W1509342228","https://openalex.org/W1513982482","https://openalex.org/W1517227803","https://openalex.org/W1524219919","https://openalex.org/W1525741606","https://openalex.org/W1530034318","https://openalex.org/W1532296632","https://openalex.org/W1556859836","https://openalex.org/W1569198079","https://openalex.org/W1570225963","https://openalex.org/W1574434095","https://openalex.org/W1578951230","https://openalex.org/W1579775238","https://openalex.org/W1587567223","https://openalex.org/W1589918049","https://openalex.org/W1592274399","https://openalex.org/W1605715232","https://openalex.org/W1814244002","https://openalex.org/W1849362181","https://openalex.org/W1850405760","https://openalex.org/W1927942528","https://openalex.org/W1966081460","https://openalex.org/W1969501661","https://openalex.org/W1977397354","https://openalex.org/W1982425678","https://openalex.org/W1988845780","https://openalex.org/W1990814178","https://openalex.org/W1990986484","https://openalex.org/W1994065560","https://openalex.org/W1994489402","https://openalex.org/W2001619061","https://openalex.org/W2004593585","https://openalex.org/W2004618348","https://openalex.org/W2008475686","https://openalex.org/W2022368654","https://openalex.org/W2028583484","https://openalex.org/W2029943378","https://openalex.org/W2030907583","https://openalex.org/W2045271686","https://openalex.org/W2049796549","https://openalex.org/W2051586165","https://openalex.org/W2053885966","https://openalex.org/W2056273707","https://openalex.org/W2060032012","https://openalex.org/W2060973867","https://openalex.org/W2060999145","https://openalex.org/W2062275397","https://openalex.org/W2063790063","https://openalex.org/W2065413511","https://openalex.org/W2068671103","https://openalex.org/W2068722602","https://openalex.org/W2069832779","https://openalex.org/W2075357518","https://openalex.org/W2077783617","https://openalex.org/W2082817855","https://openalex.org/W2083209848","https://openalex.org/W2086611351","https://openalex.org/W2086632974","https://openalex.org/W2088481129","https://openalex.org/W2091257550","https://openalex.org/W2092574257","https://openalex.org/W2097706568","https://openalex.org/W2106179083","https://openalex.org/W2111996486","https://openalex.org/W2117504352","https://openalex.org/W2120490947","https://openalex.org/W2126763909","https://openalex.org/W2129137345","https://openalex.org/W2130970357","https://openalex.org/W2138628250","https://openalex.org/W2140985588","https://openalex.org/W2150713086","https://openalex.org/W2154010459","https://openalex.org/W2155882878","https://openalex.org/W2163139704","https://openalex.org/W2163892779","https://openalex.org/W2166802878","https://openalex.org/W2173080636","https://openalex.org/W2197000251","https://openalex.org/W2462270720","https://openalex.org/W2496571351","https://openalex.org/W2601913882","https://openalex.org/W2611147814","https://openalex.org/W2912533262","https://openalex.org/W2913688336","https://openalex.org/W3022841918","https://openalex.org/W3104001151","https://openalex.org/W3199943451","https://openalex.org/W4206702770","https://openalex.org/W4285719527","https://openalex.org/W6600210833","https://openalex.org/W6601095391","https://openalex.org/W6617516190","https://openalex.org/W6630179357","https://openalex.org/W6635487903","https://openalex.org/W6903456810"],"related_works":["https://openalex.org/W7099526837","https://openalex.org/W2133331749","https://openalex.org/W7216921642","https://openalex.org/W2082536349","https://openalex.org/W2403881818","https://openalex.org/W2412622851","https://openalex.org/W2149974724","https://openalex.org/W1586314531","https://openalex.org/W1491097372","https://openalex.org/W2087687972"],"abstract_inverted_index":{"Large":[0],"and/or":[1],"computationally":[2],"expensive":[3],"optimization":[4,41],"problems":[5],"sometimes":[6],"require":[7],"parallel":[8,24,44,50,86],"or":[9],"high-performance":[10],"computing":[11,25],"systems":[12,45],"to":[13,23,35,43,52],"achieve":[14],"reasonable":[15],"running":[16],"times.":[17],"This":[18],"chapter":[19],"gives":[20],"an":[21,65],"introduction":[22],"for":[26,72,89],"those":[27],"familiar":[28],"with":[29],"serial":[30,40],"optimization.":[31,53],"We":[32,54],"present":[33],"techniques":[34],"assist":[36],"the":[37,56,68,83],"posting":[38],"of":[39,67,85],"codes":[42],"and":[46,60,63,103],"discuss":[47,82],"more":[48],"fundamentally":[49],"approaches":[51],"survey":[55],"state-of-the-art":[57],"in":[58,106],"distributed":[59],"shared-memory":[61],"architectures":[62],"give":[64],"overview":[66],"programming":[69,91],"models":[70],"appropriate":[71],"efficient":[73],"algorithms":[74,88],"on":[75,92,99,109],"these":[76],"platforms.":[77],"As":[78],"concrete":[79],"examples,":[80],"we":[81],"design":[84],"branch-and-bound":[87],"mixed-integer":[90],"a":[93,100,110],"distributed-memory":[94],"system,":[95],"quadratic":[96],"assignment":[97],"problem":[98],"grid":[101],"architecture,":[102],"maximum":[104],"parsimony":[105],"evolutionary":[107],"trees":[108],"sharedmemory":[111],"system.":[112]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}