{"id":"https://openalex.org/W2082706861","doi":"https://doi.org/10.7236/jiwit.2012.12.5.141","title":"AThe Simplified Solution for Assignment Problem","display_name":"AThe Simplified Solution for Assignment Problem","publication_year":2012,"publication_date":"2012-10-31","ids":{"openalex":"https://openalex.org/W2082706861","doi":"https://doi.org/10.7236/jiwit.2012.12.5.141","mag":"2082706861"},"language":"en","primary_location":{"id":"doi:10.7236/jiwit.2012.12.5.141","doi":"https://doi.org/10.7236/jiwit.2012.12.5.141","is_oa":false,"landing_page_url":"https://doi.org/10.7236/jiwit.2012.12.5.141","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.7905,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.74191319,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"12","issue":"5","first_page":"141","last_page":"151"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.7919999957084656,"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.7919999957084656,"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.19370000064373016,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.0044999998062849045,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/assignment-problem","display_name":"assignment problem","score":1.0},{"id":"https://openalex.org/keywords/hungarian-algorithm","display_name":"Hungarian algorithm","score":0.9750000238418579},{"id":"https://openalex.org/keywords/alternative-algorithms","display_name":"alternative algorithms","score":0.6399999856948853},{"id":"https://openalex.org/keywords/opportunity-cost","display_name":"opportunity cost","score":0.8880000114440918},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.6430000066757202},{"id":"https://openalex.org/keywords/optimal-solution","display_name":"optimal solution","score":0.8140000104904175}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5680336952209473}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.7236/jiwit.2012.12.5.141","doi":"https://doi.org/10.7236/jiwit.2012.12.5.141","is_oa":false,"landing_page_url":"https://doi.org/10.7236/jiwit.2012.12.5.141","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"},{"id":"mag:3171009084","doi":null,"is_oa":false,"landing_page_url":"https://www.earticle.net/Article/A189364","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":null,"is_accepted":false,"is_published":false,"raw_source_name":"\ud55c\uad6d\uc778\ud130\ub137\ubc29\uc1a1\ud1b5\uc2e0\ud559\ud68c \ub17c\ubb38\uc9c0","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2039282717"],"related_works":["https://openalex.org/W2384160990","https://openalex.org/W2041474949","https://openalex.org/W2039282717","https://openalex.org/W4233490443","https://openalex.org/W2360450362","https://openalex.org/W3171009084","https://openalex.org/W2460895516","https://openalex.org/W2076554191","https://openalex.org/W2529092013","https://openalex.org/W2255704913"],"abstract_inverted_index":{"This":[0,110,120],"paper":[1],"suggests":[2],"more":[3,97],"simple":[4],"algorithm":[5,8,13,46,111,121,128,148,153],"than":[6,93,98],"Hungarian":[7,12,118,127,144,152],"for":[9,51],"assignment":[10,108,142,155],"problem.":[11,156],"selects":[14,47,68],"minimum":[15,23,34,49],"cost":[16,24,50,75,81,91,95],"of":[17,33,41,79,82,126],"row":[18],"and":[19,21,85,88,105,131],"column,":[20,70],"subtracts":[22],"from":[25,138],"each":[26,52],"cost.":[27,100],"Then,":[28],"performs":[29,134],"until":[30],"the":[31,39,44,48,56,63,72,77,80,90,102,113,123,135],"number":[32,40],"lines":[35],"with":[36,59,66],"0":[37],"equals":[38],"rows.":[42],"But,":[43],"proposed":[45],"rows":[53],"only.":[54],"From":[55],"start":[57],"point":[58,65,84],"over":[60],"2":[61],"to":[62,129,140],"target":[64,86],"null":[67],"in":[69,143,154],"fixes":[71],"maximum":[73],"opportunity":[74,94],"that":[76],"difference":[78],"starting":[83],"point,":[87],"moves":[89],"less":[92],"th":[96],"previous":[99],"For":[101],"25":[103],"balance":[104,141],"7":[106],"unbalance":[107,139],"problems,":[109],"gets":[112],"optimal":[114],"solution":[115],"same":[116],"as":[117],"algorithm.":[119,145],"improves":[122],"time":[124],"complexity":[125],",":[130],"do":[132],"not":[133],"transformation":[136],"process":[137],"Therefore,":[146],"this":[147],"can":[149],"be":[150],"alter":[151]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}