{"id":"https://openalex.org/W2096861351","doi":"https://doi.org/10.1002/cpe.3155","title":"Graphics processing unit-accelerated bounding for branch-and-bound applied to a permutation problem using data access optimization","display_name":"Graphics processing unit-accelerated bounding for branch-and-bound applied to a permutation problem using data access optimization","publication_year":2013,"publication_date":"2013-10-07","ids":{"openalex":"https://openalex.org/W2096861351","doi":"https://doi.org/10.1002/cpe.3155","mag":"2096861351"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.3155","pdf_url":null,"source":{"id":"https://openalex.org/S11065456","display_name":"Concurrency and Computation Practice and Experience","issn_l":"1532-0626","issn":["1532-0626","1532-0634"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5112866837","display_name":"Nouredine Melab","orcid":null},"institutions":[{"id":"https://openalex.org/I4210138412","display_name":"Centre de recherche Inria Lille - Nord Europe","ror":"https://ror.org/04eej9726","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210138412"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"N. Melab","raw_affiliation_strings":["Universit\u00e9 Lille 1 CNRS/LIFL, INRIA Lille Nord Europe; Cit\u00e9 scientifique - 59655 Villeneuve d'Ascq cedex France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Lille 1 CNRS/LIFL, INRIA Lille Nord Europe; Cit\u00e9 scientifique - 59655 Villeneuve d'Ascq cedex France","institution_ids":["https://openalex.org/I4210138412","https://openalex.org/I1326498283","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052088324","display_name":"Imen Chakroun","orcid":"https://orcid.org/0000-0002-8873-1793"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210138412","display_name":"Centre de recherche Inria Lille - Nord Europe","ror":"https://ror.org/04eej9726","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210138412"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"I. Chakroun","raw_affiliation_strings":["Universit\u00e9 Lille 1 CNRS/LIFL, INRIA Lille Nord Europe; Cit\u00e9 scientifique - 59655 Villeneuve d'Ascq cedex France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Lille 1 CNRS/LIFL, INRIA Lille Nord Europe; Cit\u00e9 scientifique - 59655 Villeneuve d'Ascq cedex France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210138412","https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015208242","display_name":"Ahc\u00e8ne Bendjoudi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210095777","display_name":"Centre de Recherche sur l'Information Scientifique et Technique","ror":"https://ror.org/01k1bte55","country_code":"DZ","type":"government","lineage":["https://openalex.org/I4210095777","https://openalex.org/I4210114810"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"A. Bendjoudi","raw_affiliation_strings":["CEntre de Recherche sur l'Information Scientifique et Technique (CERIST); 16030 Ben-Aknoun Algiers Algeria"],"affiliations":[{"raw_affiliation_string":"CEntre de Recherche sur l'Information Scientifique et Technique (CERIST); 16030 Ben-Aknoun Algiers Algeria","institution_ids":["https://openalex.org/I4210095777"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":4740,"currency":"USD","value_usd":4740,"provenance":"doaj"},"apc_paid":null,"fwci":5.223,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":14,"citation_normalized_percentile":{"value":0.872053,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":88},"biblio":{"volume":"26","issue":"16","first_page":"2667","last_page":"2683"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998,"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.9998,"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/T12288","display_name":"Optimization and Search Problems","score":0.9986,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9973,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graphics-processing-unit","display_name":"Graphics processing unit","score":0.75472987},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.7277081},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.55614984},{"id":"https://openalex.org/keywords/b-tree","display_name":"B-tree","score":0.5481796},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.53730905},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.46182021},{"id":"https://openalex.org/keywords/bounding-volume","display_name":"Bounding volume","score":0.4198844}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7831379},{"id":"https://openalex.org/C2779851693","wikidata":"https://www.wikidata.org/wiki/Q183484","display_name":"Graphics processing unit","level":2,"score":0.75472987},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7277081},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.64612186},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.55614984},{"id":"https://openalex.org/C78669399","wikidata":"https://www.wikidata.org/wiki/Q677051","display_name":"B-tree","level":3,"score":0.5481796},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.53730905},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.4996519},{"id":"https://openalex.org/C50630238","wikidata":"https://www.wikidata.org/wiki/Q971505","display_name":"General-purpose computing on graphics processing units","level":3,"score":0.48549655},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47476196},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.46182021},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.44477296},{"id":"https://openalex.org/C184585634","wikidata":"https://www.wikidata.org/wiki/Q1434060","display_name":"Bounding volume","level":4,"score":0.4198844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35919273},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22692046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15854624},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.3155","pdf_url":null,"source":{"id":"https://openalex.org/S11065456","display_name":"Concurrency and Computation Practice and Experience","issn_l":"1532-0626","issn":["1532-0626","1532-0634"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://hal.inria.fr/hal-01095244","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":["Centre National de la Recherche Scientifique"],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01095244","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.44}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":15,"referenced_works":["https://openalex.org/W1918657425","https://openalex.org/W1999339786","https://openalex.org/W2001080175","https://openalex.org/W2011039300","https://openalex.org/W2024085737","https://openalex.org/W2051370696","https://openalex.org/W2060032012","https://openalex.org/W2088752164","https://openalex.org/W2090156293","https://openalex.org/W2117400912","https://openalex.org/W2132806150","https://openalex.org/W2136315902","https://openalex.org/W2154117831","https://openalex.org/W2611328","https://openalex.org/W610778723"],"related_works":["https://openalex.org/W3158047141","https://openalex.org/W2388314963","https://openalex.org/W2167646277","https://openalex.org/W2151046618","https://openalex.org/W2063573318","https://openalex.org/W2027443981","https://openalex.org/W1972148443","https://openalex.org/W1969233021","https://openalex.org/W1656096860","https://openalex.org/W151175334"],"abstract_inverted_index":{"Branch-and-bound":[0],"(B&B)":[1],"algorithms":[2],"are":[3,26,186],"attractive":[4],"methods":[5],"for":[6,188],"solving":[7],"to":[8,46,57,70,122,166],"optimality":[9],"combinatorial":[10],"optimization":[11],"problems":[12],"using":[13,158,172],"an":[14,159,173,193],"implicit":[15],"enumeration":[16],"of":[17,50,64,96,100,111,133],"a":[18,43,66,118,167],"dynamically":[19],"built":[20],"tree-based":[21],"search":[22,53],"space.":[23,54],"Nevertheless,":[24],"they":[25],"time-consuming":[27],"when":[28],"dealing":[29],"with":[30],"large":[31,189],"problem":[32,85,190],"instances.":[33,191],"Therefore,":[34],"pruning":[35],"tree":[36],"nodes":[37],"(subproblems)":[38],"is":[39,199],"traditionally":[40],"used":[41],"as":[42,117],"powerful":[44],"mechanism":[45],"reduce":[47],"the":[48,51,59,71,75,82,90,97,101,109,125,129,134],"size":[49],"explored":[52],"Pruning":[55],"requires":[56],"perform":[58],"bounding":[60,91,136],"operation,":[61],"which":[62],"consists":[63],"applying":[65],"lower":[67],"bound":[68],"function":[69],"subproblems":[72],"generated":[73],"during":[74],"exploration":[76],"process.":[77],"Preliminary":[78],"experiments":[79,149],"performed":[80],"on":[81,138,154],"Flow-Shop":[83],"scheduling":[84],"(FSP)":[86],"have":[87,150],"shown":[88],"that":[89],"operation":[92],"consumes":[93],"over":[94],"98%":[95],"execution":[98,171],"time":[99],"B&B":[102,198],"algorithm.":[103],"In":[104],"this":[105],"paper,":[106],"we":[107],"investigate":[108],"use":[110],"graphics":[112],"processing":[113],"unit":[114],"(GPU)":[115],"computing":[116],"major":[119],"complementary":[120],"way":[121],"speed":[123],"up":[124],"search.":[126],"We":[127],"revisit":[128],"design":[130],"and":[131],"implementation":[132],"parallel":[135],"model":[137],"GPU":[139,163],"accelerators.":[140],"The":[141],"proposed":[142],"approach":[143],"enables":[144],"data":[145],"access":[146],"optimization.":[147],"Extensive":[148],"been":[151],"carried":[152],"out":[153],"well-known":[155],"FSP":[156],"benchmarks":[157],"Nvidia":[160],"Tesla":[161],"C2050":[162],"card.":[164],"Compared":[165],"CPU-based":[168],"single":[169],"core":[170],"Intel":[174],"Core":[175],"i7-970":[176],"processor":[177],"without":[178],"GPU,":[179],"speedups":[180],"higher":[181],"than":[182,202],"100":[183],"times":[184],"faster":[185,201],"achieved":[187],"At":[192],"equivalent":[194],"peak":[195],"performance,":[196],"GPU-accelerated":[197],"twice":[200],"its":[203],"multi-core":[204],"counterpart.":[205],"Copyright":[206],"\u00a9":[207],"2013":[208],"John":[209],"Wiley":[210],"&":[211],"Sons,":[212],"Ltd.":[213]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2096861351","counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-01-17T09:12:18.132531","created_date":"2016-06-24"}