乐胖代购免代理版

{"id":"https://openalex.org/W4297498048","doi":"https://doi.org/10.1016/j.tcs.2022.09.026","title":"Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems","display_name":"Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems","publication_year":2022,"publication_date":"2022-09-28","ids":{"openalex":"https://openalex.org/W4297498048","doi":"https://doi.org/10.1016/j.tcs.2022.09.026"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2022.09.026","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.tcs.2022.09.026","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006805520","display_name":"Marcel Turkensteen","orcid":"https://orcid.org/0000-0001-9118-1561"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Marcel Turkensteen","raw_affiliation_strings":["Department of Economics and Business Economics, School of Business and Social Sciences, Aarhus University, DK-8210 Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Economics and Business Economics, School of Business and Social Sciences, Aarhus University, DK-8210 Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055839194","display_name":"Gerold J\u00e4ger","orcid":null},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Gerold J\u00e4ger","raw_affiliation_strings":["Department of Mathematics and Mathematical Statistics, University of Ume\u00e5, SE-901-87 Ume\u00e5, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Mathematical Statistics, University of Ume\u00e5, SE-901-87 Ume\u00e5, Sweden","institution_ids":["https://openalex.org/I90267481"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006805520"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690,"provenance":"doaj"},"apc_paid":{"value":2690,"currency":"USD","value_usd":2690,"provenance":"doaj"},"fwci":0.578,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":3,"citation_normalized_percentile":{"value":0.511802,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":76,"max":80},"biblio":{"volume":"937","issue":null,"first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","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/T10567","display_name":"Vehicle Routing Optimization Methods","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/T12176","display_name":"Optimization and Packing Problems","score":0.9979,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9957,"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/tree","display_name":"Tree (set theory)","score":0.41824135}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.92511296},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7696022},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.71097505},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.64607257},{"id":"https://openalex.org/C165810428","wikidata":"https://www.wikidata.org/wiki/Q6553416","display_name":"Linear bottleneck assignment problem","level":5,"score":0.52360874},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.47597662},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4548699},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.44931242},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.44709086},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44608042},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41824135},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36455482},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.14169043},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09744254},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.088578075},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.073880464},{"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C24326235","wikidata":"https://www.wikidata.org/wiki/Q126095","display_name":"Electronic engineering","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2022.09.026","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},{"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-200411","pdf_url":"http://umu.diva-portal.org/smash/get/diva2:1705043/FULLTEXT02","source":{"id":"https://openalex.org/S4306400360","display_name":"DiVA at Ume\u00e5 University (Ume\u00e5 University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I90267481","host_organization_name":"Ume\u00e5 University","host_organization_lineage":["https://openalex.org/I90267481"],"host_organization_lineage_names":["Ume\u00e5 University"],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2022.09.026","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":27,"referenced_works":["https://openalex.org/W10798649","https://openalex.org/W1965525854","https://openalex.org/W1968182342","https://openalex.org/W1968740067","https://openalex.org/W1973362730","https://openalex.org/W1983538867","https://openalex.org/W1988114663","https://openalex.org/W2004865003","https://openalex.org/W2012336927","https://openalex.org/W2017708378","https://openalex.org/W2017927472","https://openalex.org/W2028068470","https://openalex.org/W2028589351","https://openalex.org/W2044060832","https://openalex.org/W2058946929","https://openalex.org/W2076554191","https://openalex.org/W2091614717","https://openalex.org/W2130762182","https://openalex.org/W2132287256","https://openalex.org/W2141343969","https://openalex.org/W2144045033","https://openalex.org/W2159018822","https://openalex.org/W2160907067","https://openalex.org/W2222512263","https://openalex.org/W2725917655","https://openalex.org/W2884276863","https://openalex.org/W3137299218"],"related_works":["https://openalex.org/W3082895109","https://openalex.org/W2375416089","https://openalex.org/W2295532445","https://openalex.org/W2102910605","https://openalex.org/W2036665495","https://openalex.org/W2026114366","https://openalex.org/W1987420052","https://openalex.org/W1984988614","https://openalex.org/W1967185041","https://openalex.org/W1965349047"],"abstract_inverted_index":{"This":[0,56],"paper":[1,57],"considers":[2],"combinatorial":[3],"optimization":[4],"problems":[5],"with":[6],"an":[7,34,53,75,80],"objective":[8,14],"of":[9,33,52,70,95,102],"type":[10],"bottleneck,":[11],"so":[12],"the":[13,18,31,50,68,93,103,108],"is":[15,92],"to":[16,37],"minimize":[17],"maximum":[19],"cost":[20,71],"among":[21],"all":[22],"elements":[23],"in":[24,39,46,74],"a":[25],"feasible":[26],"solution.":[27,55],"For":[28],"these":[29],"problems,":[30],"sensitivity":[32],"optimal":[35,54,81],"solution":[36,86],"changes":[38],"parameters":[40],"has":[41],"received":[42],"much":[43],"less":[44],"attention":[45],"existing":[47],"studies":[48],"than":[49],"computation":[51,97],"introduces":[58],"methods":[59,98],"for":[60,99],"computing":[61],"upper":[62],"and":[63,78,107],"lower":[64],"tolerances":[65],"which":[66],"measure":[67],"amount":[69],"change":[72],"needed":[73],"element":[76],"inside":[77],"outside":[79],"solution,":[82],"respectively,":[83],"before":[84],"that":[85],"becomes":[87],"non-optimal.":[88],"Our":[89],"main":[90],"contribution":[91],"development":[94],"efficient":[96],"bottleneck":[100],"versions":[101],"Linear":[104],"Assignment":[105],"Problem":[106],"Minimum":[109],"Spanning":[110],"Tree":[111],"Problem.":[112]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4297498048","counts_by_year":[{"year":2024,"cited_by_count":3}],"updated_date":"2024-12-13T18:58:49.614298","created_date":"2022-09-29"}