乐胖代购免代理版

{"id":"https://openalex.org/W2075244230","doi":"https://doi.org/10.1109/hipc.2013.6799105","title":"A Branch-and-Bound algorithm using multiple GPU-based LP solvers","display_name":"A Branch-and-Bound algorithm using multiple GPU-based LP solvers","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2075244230","doi":"https://doi.org/10.1109/hipc.2013.6799105","mag":"2075244230"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/hipc.2013.6799105","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5051907450","display_name":"Xavier Meyer","orcid":"https://orcid.org/0000-0003-2400-9598"},"institutions":[{"id":"https://openalex.org/I114457229","display_name":"University of Geneva","ror":"https://ror.org/01swzsf04","country_code":"CH","type":"education","lineage":["https://openalex.org/I114457229"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Xavier Meyer","raw_affiliation_strings":["Department of Computer Science, University of Geneva, Geneva, Switzerland#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Geneva, Geneva, Switzerland#TAB#","institution_ids":["https://openalex.org/I114457229"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025249509","display_name":"Bastien Chopard","orcid":"https://orcid.org/0000-0002-6638-0945"},"institutions":[{"id":"https://openalex.org/I114457229","display_name":"University of Geneva","ror":"https://ror.org/01swzsf04","country_code":"CH","type":"education","lineage":["https://openalex.org/I114457229"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Bastien Chopard","raw_affiliation_strings":["Department of Computer Science, University of Geneva, Geneva, Switzerland#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Geneva, Geneva, Switzerland#TAB#","institution_ids":["https://openalex.org/I114457229"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015793292","display_name":"Paul Albuquerque","orcid":null},"institutions":[{"id":"https://openalex.org/I173439891","display_name":"HES-SO University of Applied Sciences and Arts Western Switzerland","ror":"https://ror.org/01xkakk17","country_code":"CH","type":"education","lineage":["https://openalex.org/I173439891"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Paul Albuquerque","raw_affiliation_strings":["Inst. for Inf. & Telecommun., Univ. of Appl. Sci. of Western Switzerland, Geneva, Switzerland"],"affiliations":[{"raw_affiliation_string":"Inst. for Inf. & Telecommun., Univ. of Appl. Sci. of Western Switzerland, Geneva, Switzerland","institution_ids":["https://openalex.org/I173439891"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.842,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":5,"citation_normalized_percentile":{"value":0.737253,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":80,"max":81},"biblio":{"volume":null,"issue":null,"first_page":"129","last_page":"138"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9996,"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.9996,"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.9981,"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/T10142","display_name":"Formal Methods in Verification","score":0.9974,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/solver","display_name":"Solver","score":0.81014884},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5191642},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44324195}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.81014884},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7786385},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7322476},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.69678646},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5405634},{"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.5398149},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.53345513},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5191642},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.51864475},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.44415247},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44324195},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33861816},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2710958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18148157},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.120319545},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08066833},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07869235},{"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":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/hipc.2013.6799105","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":[{"score":0.62,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":27,"referenced_works":["https://openalex.org/W1563121416","https://openalex.org/W1918657425","https://openalex.org/W1977310057","https://openalex.org/W1978917746","https://openalex.org/W1996622306","https://openalex.org/W1999049191","https://openalex.org/W2011959190","https://openalex.org/W2017950741","https://openalex.org/W2028909663","https://openalex.org/W2046295359","https://openalex.org/W2060032012","https://openalex.org/W2060514920","https://openalex.org/W2062090047","https://openalex.org/W2066443208","https://openalex.org/W2071877138","https://openalex.org/W2080122216","https://openalex.org/W2107352296","https://openalex.org/W2117400912","https://openalex.org/W2117470170","https://openalex.org/W2127093012","https://openalex.org/W2151252959","https://openalex.org/W2154117831","https://openalex.org/W2163688235","https://openalex.org/W2168553375","https://openalex.org/W2222122796","https://openalex.org/W4255329848","https://openalex.org/W642849076"],"related_works":["https://openalex.org/W3048701459","https://openalex.org/W2941986668","https://openalex.org/W240129890","https://openalex.org/W2389600408","https://openalex.org/W2370314112","https://openalex.org/W2364044215","https://openalex.org/W2149078538","https://openalex.org/W2080146221","https://openalex.org/W1963859303","https://openalex.org/W1912958759"],"abstract_inverted_index":{"The":[0,100,125,135],"Branch-and-Bound":[1],"(B&B)":[2],"method":[3,112],"is":[4,23,70,103,113,156],"a":[5,45,50,92,115,139,173,190],"well-known":[6,174],"optimization":[7],"algorithm":[8,145],"for":[9,31],"solving":[10],"integer":[11],"linear":[12,57],"programming":[13,58],"(ILP)":[14],"models":[15],"in":[16,81],"the":[17,68,71,97,106,109,120,132,143,148,153,159,169,181],"field":[18],"of":[19,25,96,123,131,142,168,180],"operations":[20],"research.":[21],"It":[22,41],"part":[24],"software":[26],"often":[27],"employed":[28],"by":[29,48,105],"businesses":[30],"finding":[32],"solutions":[33],"to":[34,44,66,147,172],"problems":[35],"such":[36],"as":[37],"airline":[38],"scheduling":[39],"problems.":[40,60],"operates":[42],"according":[43],"divide-and-conquer":[46],"principle":[47],"building":[49],"tree-like":[51],"structure":[52],"with":[53,138,158],"nodes":[54,69],"that":[55,152],"represent":[56],"(LP)":[59],"A":[61],"LP":[62,133,149],"solver":[63],"commonly":[64],"used":[65],"process":[67],"simplex":[72,111,171],"method.":[73],"Nowadays":[74],"its":[75,199],"sequential":[76,140,176,200],"implementation":[77,95,141,167,197],"can":[78],"be":[79],"found":[80],"almost":[82],"all":[83],"commercial":[84],"ILP":[85],"solvers.":[86],"In":[87],"this":[88],"paper,":[89],"we":[90,188],"present":[91],"hybrid":[93],"CPU-GPU":[94],"B&B":[98,101,144,154],"algorithm.":[99],"tree":[102,155],"managed":[104,157],"CPU,":[107],"while":[108],"revised":[110,170],"mainly":[114],"GPU":[116,196],"implementation,":[117],"relying":[118],"on":[119],"CUDA":[121],"technology":[122],"NVIDIA.":[124],"CPU":[126],"manages":[127],"concurrently":[128],"multiple":[129],"instances":[130],"solver.":[134],"principal":[136],"difference":[137],"pertains":[146],"solver,":[150,177],"provided":[151],"same":[160],"strategy.":[161],"We":[162],"thus":[163],"compared":[164],"our":[165,195],"GPU-based":[166],"open-source":[175],"named":[178],"CLP,":[179],"COIN-OR":[182],"project.":[183],"For":[184],"given":[185],"problem":[186],"densities,":[187],"measured":[189],"size":[191],"threshhold":[192],"beyond":[193],"which":[194],"outperformed":[198],"counterpart.":[201]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2075244230","counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-01-18T21:36:34.708483","created_date":"2016-06-24"}