{"id":"https://openalex.org/W2095522801","doi":"https://doi.org/10.1016/s0305-0548(96)00094-9","title":"A parallel branch-and-bound algorithm for multicommodity location with balancing requirements","display_name":"A parallel branch-and-bound algorithm for multicommodity location with balancing requirements","publication_year":1997,"publication_date":"1997-09-01","ids":{"openalex":"https://openalex.org/W2095522801","doi":"https://doi.org/10.1016/s0305-0548(96)00094-9","mag":"2095522801"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(96)00094-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(96)00094-9","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-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/A5086988161","display_name":"Bernard Gendron","orcid":"https://orcid.org/0000-0002-7417-1940"},"institutions":[{"id":"https://openalex.org/I70931966","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34","country_code":"CA","type":"education","lineage":["https://openalex.org/I70931966"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Bernard Gendron","raw_affiliation_strings":["D\u00e9partement d'informatique et de recherche op\u00e9rationnelle and Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al, C.P. 6128, Succursale Centre-Ville, Montreal, Quebec, H3C 3J7, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement d'informatique et de recherche op\u00e9rationnelle and Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al, C.P. 6128, Succursale Centre-Ville, Montreal, Quebec, H3C 3J7, Canada","institution_ids":["https://openalex.org/I70931966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041183626","display_name":"Teodor Gabriel Crainic","orcid":"https://orcid.org/0000-0002-4424-0984"},"institutions":[{"id":"https://openalex.org/I159129438","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al","ror":"https://ror.org/002rjbv21","country_code":"CA","type":"education","lineage":["https://openalex.org/I159129438","https://openalex.org/I49663120"]},{"id":"https://openalex.org/I70931966","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34","country_code":"CA","type":"education","lineage":["https://openalex.org/I70931966"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Teodor Gabriel Crainic","raw_affiliation_strings":["D\u00e9partement des sciences administratives, Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al and Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al, Montreal, Quebec, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement des sciences administratives, Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al and Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al, Montreal, Quebec, Canada","institution_ids":["https://openalex.org/I159129438","https://openalex.org/I70931966"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086988161"],"corresponding_institution_ids":["https://openalex.org/I70931966"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":1.0548,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.79765836,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"24","issue":"9","first_page":"829","last_page":"847"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9997000098228455,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9997000098228455,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"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.9937000274658203,"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/initialization","display_name":"Initialization","score":0.8004966974258423},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7077786326408386},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6677740216255188},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6342345476150513},{"id":"https://openalex.org/keywords/workstation","display_name":"Workstation","score":0.5444201231002808},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48799270391464233},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.483418345451355},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44866642355918884},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.4397073984146118},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.43584901094436646},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4337505102157593},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.290155827999115}],"concepts":[{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.8004966974258423},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7077786326408386},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6677740216255188},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6342345476150513},{"id":"https://openalex.org/C67953723","wikidata":"https://www.wikidata.org/wiki/Q192525","display_name":"Workstation","level":2,"score":0.5444201231002808},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48799270391464233},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.483418345451355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44866642355918884},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.4397073984146118},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.43584901094436646},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4337505102157593},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.290155827999115},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0305-0548(96)00094-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(96)00094-9","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W244644848","https://openalex.org/W636501624","https://openalex.org/W1498148168","https://openalex.org/W1803694112","https://openalex.org/W1997202925","https://openalex.org/W2003594070","https://openalex.org/W2040934346","https://openalex.org/W2041621901","https://openalex.org/W2045045217","https://openalex.org/W2054583871","https://openalex.org/W2060032012","https://openalex.org/W2068267372","https://openalex.org/W2069701305","https://openalex.org/W2088659184","https://openalex.org/W2090983252","https://openalex.org/W2165012734","https://openalex.org/W2402281147","https://openalex.org/W2606195968","https://openalex.org/W6620614888"],"related_works":["https://openalex.org/W3204184292","https://openalex.org/W3176564347","https://openalex.org/W1985458517","https://openalex.org/W2355833770","https://openalex.org/W3031039437","https://openalex.org/W3095877357","https://openalex.org/W183202219","https://openalex.org/W10861731","https://openalex.org/W2072565696","https://openalex.org/W2050451745"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}