{"id":"https://openalex.org/W4412388228","doi":"https://doi.org/10.61841/turcomat.v15i3.15270","title":"SOLVING THE ASSIGNMENT PROBLEM VIA THE ABSOLUTE DIFFERENCE CALCULATION ALGORITHM","display_name":"SOLVING THE ASSIGNMENT PROBLEM VIA THE ABSOLUTE DIFFERENCE CALCULATION ALGORITHM","publication_year":2024,"publication_date":"2024-05-22","ids":{"openalex":"https://openalex.org/W4412388228","doi":"https://doi.org/10.61841/turcomat.v15i3.15270"},"language":"en","primary_location":{"id":"doi:10.61841/turcomat.v15i3.15270","doi":"https://doi.org/10.61841/turcomat.v15i3.15270","is_oa":true,"landing_page_url":"https://doi.org/10.61841/turcomat.v15i3.15270","pdf_url":"https://turcomat.org/index.php/turkbilmat/article/download/15270/10937","source":{"id":"https://openalex.org/S4306533463","display_name":"Turkish Journal of Computer and Mathematics Education (TURCOMAT)","issn_l":"3048-4855","issn":["3048-4855"],"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Turkish Journal of Computer and Mathematics Education (TURCOMAT)","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://turcomat.org/index.php/turkbilmat/article/download/15270/10937","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004263954","display_name":"Yogesh M Muley","orcid":"https://orcid.org/0000-0001-9398-1300","observed_orcids":["https://orcid.org/0000-0001-9398-1300"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yogesh M Muley","raw_affiliation_strings":["Department of Mathematics, Kai. Rasika Mahavidyalaya, Deoni, Dist. Latur (MH) India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Kai. Rasika Mahavidyalaya, Deoni, Dist. Latur (MH) India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5004263954"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"3","first_page":"442","last_page":"458"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9423999786376953,"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.9423999786376953,"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.03779999911785126,"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.006399999838322401,"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.824999988079071},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9470000267028809},{"id":"https://openalex.org/keywords/cost-minimization","display_name":"cost minimization","score":0.7350000143051147},{"id":"https://openalex.org/keywords/matlab-implementation","display_name":"MATLAB implementation","score":0.5239999890327454}],"concepts":[{"id":"https://openalex.org/C2777487392","wikidata":"https://www.wikidata.org/wiki/Q481201","display_name":"Absolute (philosophy)","level":2,"score":0.6602468490600586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5228458046913147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40264832973480225},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3886135220527649},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3469344675540924},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.61841/turcomat.v15i3.15270","doi":"https://doi.org/10.61841/turcomat.v15i3.15270","is_oa":true,"landing_page_url":"https://doi.org/10.61841/turcomat.v15i3.15270","pdf_url":"https://turcomat.org/index.php/turkbilmat/article/download/15270/10937","source":{"id":"https://openalex.org/S4306533463","display_name":"Turkish Journal of Computer and Mathematics Education (TURCOMAT)","issn_l":"3048-4855","issn":["3048-4855"],"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Turkish Journal of Computer and Mathematics Education (TURCOMAT)","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.61841/turcomat.v15i3.15270","doi":"https://doi.org/10.61841/turcomat.v15i3.15270","is_oa":true,"landing_page_url":"https://doi.org/10.61841/turcomat.v15i3.15270","pdf_url":"https://turcomat.org/index.php/turkbilmat/article/download/15270/10937","source":{"id":"https://openalex.org/S4306533463","display_name":"Turkish Journal of Computer and Mathematics Education (TURCOMAT)","issn_l":"3048-4855","issn":["3048-4855"],"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Turkish Journal of Computer and Mathematics Education (TURCOMAT)","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322945","display_name":"Swami Ramanand Teerth Marathwada University","ror":"https://ror.org/03nevd013"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412388228.pdf","grobid_xml":"https://content.openalex.org/works/W4412388228.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W2222512263","https://openalex.org/W2511232704","https://openalex.org/W2809162569","https://openalex.org/W3083528363","https://openalex.org/W4391285994"],"related_works":["https://openalex.org/W2182492980","https://openalex.org/W2610929847","https://openalex.org/W3168144563","https://openalex.org/W6949281228","https://openalex.org/W2030497423","https://openalex.org/W4408981747","https://openalex.org/W4410918336","https://openalex.org/W4379802400","https://openalex.org/W4214893413","https://openalex.org/W7212859284"],"abstract_inverted_index":{"The":[0],"assignment":[1,32],"problem":[2],"is":[3,67,80],"a":[4,21],"fundamental":[5],"combinatorial":[6],"optimization":[7],"challenge":[8],"with":[9],"applications":[10],"across":[11],"industries,":[12],"where":[13],"resources":[14],"must":[15],"be":[16],"assigned":[17],"to":[18,38,72,82],"tasks":[19],"in":[20,54,64],"cost-efficient":[22],"manner.":[23],"Traditional":[24],"approaches,":[25],"such":[26],"as":[27],"the":[28,36,60],"Hungarian":[29],"algorithm,":[30,53],"minimize":[31],"costs":[33],"by":[34],"reducing":[35],"matrix":[37],"an":[39,45,49],"optimal":[40],"form.":[41],"This":[42],"study":[43],"introduces":[44],"alternative":[46],"approach":[47],"using":[48],"\"absolute":[50],"difference":[51,58],"calculation\"":[52],"which":[55],"each":[56],"element\u2019s":[57],"from":[59],"minimum":[61],"or":[62],"maximum":[63],"its":[65],"row":[66],"evaluated":[68],"and":[69,76],"adjusted":[70],"iteratively":[71],"ensure":[73],"feasible":[74],"solutions":[75],"finally":[77],"MATLAB":[78],"program":[79],"used":[81],"solve":[83],"example.":[84]},"counts_by_year":[],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2025-10-10T00:00:00"}