{"id":"https://openalex.org/W2053461222","doi":"https://doi.org/10.7236/jiibc.2013.13.6.211","title":"Linear Bottleneck Assignment Problem Based on Reverse-delete Algorithm","display_name":"Linear Bottleneck Assignment Problem Based on Reverse-delete Algorithm","publication_year":2013,"publication_date":"2013-12-31","ids":{"openalex":"https://openalex.org/W2053461222","doi":"https://doi.org/10.7236/jiibc.2013.13.6.211","mag":"2053461222"},"language":"en","primary_location":{"id":"doi:10.7236/jiibc.2013.13.6.211","doi":"https://doi.org/10.7236/jiibc.2013.13.6.211","is_oa":false,"landing_page_url":"https://doi.org/10.7236/jiibc.2013.13.6.211","pdf_url":null,"source":{"id":"https://openalex.org/S4306496884","display_name":"\ud55c\uad6d\uc778\ud130\ub137\ubc29\uc1a1\ud1b5\uc2e0\ud559\ud68c \ub17c\ubb38\uc9c0","issn_l":"1738-4281","issn":["1738-4281","1975-1842","2288-0879","2288-2618","2289-0238","2289-0246"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Journal of the Institute of Webcasting, Internet and Telecommunication","raw_type":"journal-article"},"volume":null,"type":"article","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/A5024139086","display_name":"Sang-Un Lee","orcid":"https://orcid.org/0009-0004-9128-9328","observed_orcids":["https://orcid.org/0009-0004-9128-9328"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sang-Un Lee","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5024139086"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3993,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65001812,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"13","issue":"6","first_page":"211","last_page":"220"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.8428000211715698,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.8428000211715698,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.13529999554157257,"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"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.0034000000450760126,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bottleneck-assignment-problem","display_name":"bottleneck assignment problem","score":0.9319999814033508},{"id":"https://openalex.org/keywords/thresholding-algorithm","display_name":"threshold algorithm","score":0.6669999957084656},{"id":"https://openalex.org/keywords/augmenting-path-algorithm","display_name":"augmenting path algorithm","score":0.9900000095367432},{"id":"https://openalex.org/keywords/unbalanced-assignment-problem","display_name":"unbalanced assignment problem","score":0.734000027179718},{"id":"https://openalex.org/keywords/optimal-solution","display_name":"optimal solution","score":0.5879999995231628}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.784203052520752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6825433373451233},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5735248923301697},{"id":"https://openalex.org/C165810428","wikidata":"https://www.wikidata.org/wiki/Q6553416","display_name":"Linear bottleneck assignment problem","level":5,"score":0.49272778630256653},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.14098605513572693},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.12268528342247009},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.07133853435516357},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.7236/jiibc.2013.13.6.211","doi":"https://doi.org/10.7236/jiibc.2013.13.6.211","is_oa":false,"landing_page_url":"https://doi.org/10.7236/jiibc.2013.13.6.211","pdf_url":null,"source":{"id":"https://openalex.org/S4306496884","display_name":"\ud55c\uad6d\uc778\ud130\ub137\ubc29\uc1a1\ud1b5\uc2e0\ud559\ud68c \ub17c\ubb38\uc9c0","issn_l":"1738-4281","issn":["1738-4281","1975-1842","2288-0879","2288-2618","2289-0238","2289-0246"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Journal of the Institute of Webcasting, Internet and Telecommunication","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W53740398","https://openalex.org/W1984988614","https://openalex.org/W1988114663","https://openalex.org/W2041474949","https://openalex.org/W2071231483","https://openalex.org/W2082706861","https://openalex.org/W2130376892","https://openalex.org/W2167207830","https://openalex.org/W2222512263","https://openalex.org/W2248831598","https://openalex.org/W2316240524"],"related_works":["https://openalex.org/W4248260775","https://openalex.org/W2342802839","https://openalex.org/W2985782692","https://openalex.org/W2529092013","https://openalex.org/W1925180958","https://openalex.org/W2318272049","https://openalex.org/W2039282717","https://openalex.org/W2248831598","https://openalex.org/W3171009084","https://openalex.org/W2285576001"],"abstract_inverted_index":{"\ubcf8":[0],"\ub17c\ubb38\uc740":[1],"\uc120\ud615":[2],"\ubcd1\ubaa9\ud560\ub2f9":[3,11],"\ubb38\uc81c\uc758":[4,12],"\ucd5c\uc801\ud574\ub97c":[5,65],"\uac04\ub2e8\ud788":[6],"\ucc3e\ub294":[7],"\uc54c\uace0\ub9ac\uc998\uc744":[8,52],"\uc81c\uc548\ud558\uc600\ub2e4.":[9],"\uc77c\ubc18\uc801\uc73c\ub85c":[10],"\ucd5c\uc801\ud574\ub294":[13],"\ud55c\uacc4":[14],"\ub610\ub294":[15,28],"\uc99d\ub300\uacbd\ub85c":[16],"\uc54c\uace0\ub9ac\uc998\uc73c\ub85c":[17],"\uad6c\ud55c\ub2e4.":[18,38],"\uc81c\uc548\ub41c":[19,51],"\uc54c\uace0\ub9ac\uc998\uc740":[20],"2\ub2e8\uacc4\ub97c":[21],"\uc218\ud589\ud558\ub294":[22],"\uc5ed-\uc0ad\uc81c":[23],"\uc54c\uace0\ub9ac\uc998\uc774\ub2e4.":[24],"\uccab":[25],"\ubc88\uc9f8\ub85c,":[26],"\ud589":[27],"\uc5f4\uc758":[29],"\uac1c\uc218\uac00":[30],"1\uac1c\uac00":[31],"\ub420":[32],"\ub54c\uae4c\uc9c0":[33],"\ucd5c\ub300":[34],"\ube44\uc6a9\uc744":[35],"\uc0ad\uc81c\ud558\uc5ec":[36],"\ucd08\uae30\ud574\ub97c":[37],"\ub450":[39],"\ubc88\uc9f8\ub85c":[40],"\ud55c\uacc4\uce58":[41],"\ubcf4\ub2e4":[42],"\ud070":[43],"\uac12\uc774":[44],"\ucd08\uae30\ud574\ub85c":[45],"\uc120\ud0dd\ub418\uc5c8\uc73c\uba74":[46],"\ud574\ub97c":[47],"\uac1c\uc120\ud558\ub294":[48],"\uacfc\uc815\uc744":[49],"\uc218\ud589\ud558\uc600\ub2e4.":[50],"28\uac1c\uc758":[53],"\ubcd1\ubaa9":[54,59],"\uade0\ud615":[55],"\ud560\ub2f9":[56,61],"\ubb38\uc81c\uc640":[57],"7\uac1c\uc758":[58],"\ubd88\uade0\ud615":[60],"\ubb38\uc81c\uc5d0":[62],"\uc801\uc6a9\ud55c":[63],"\uacb0\uacfc":[64],"\uc27d\uac8c":[66],"\ucc3e\ub294\ub370":[67],"\uc131\uacf5\ud558\uc600\ub2e4.":[68],"\u3010This":[69],"paper":[70,104],"proposes":[71,105],"an":[72,77],"algorithm":[73,92,108,115,134,163],"that":[74,93,109,138],"easily":[75],"finds":[76],"optimal":[78],"solution":[79,137],"for":[80],"linear":[81],"bottleneck":[82,100],"assignment":[83,101,156],"problems.":[84],"It":[85],"is":[86,94,164],"either":[87],"threshold":[88,144],"or":[89,130],"augmenting":[90],"path":[91],"generally":[95],"used":[96],"to":[97,153,166],"solve":[98],"the":[99,114,117,133,143,162],"problem.":[102],"This":[103],"a":[106,121,127,140],"reverse-delete":[107],"follows":[110],"2":[111],"steps.":[112],"Firstly,":[113],"deletes":[116],"maximum":[118],"cost":[119,141],"in":[120],"given":[122],"matrix":[123],"until":[124],"it":[125],"renders":[126],"single":[128],"row":[129],"column.":[131],"Next,":[132],"improves":[135],"any":[136],"contains":[139],"exceeding":[142],"value":[145],"$c^*_{ij}$":[147],".":[149],"Upon":[150],"its":[151],"application":[152],"28":[154],"balanced":[155],"problems":[157],"and":[158,170],"7":[159],"unbalanced":[160],"problems,":[161],"found":[165],"be":[167],"both":[168],"successful":[169],"simple.\u3011":[171]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-09-21T07:43:02.447757","created_date":"2016-06-24T00:00:00"}