{"id":"https://openalex.org/W2362756247","doi":null,"title":"An Algorithm for Solving the Assignment Problem","display_name":"An Algorithm for Solving the Assignment Problem","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2362756247","mag":"2362756247"},"language":"en","primary_location":{"id":"mag:2362756247","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-YCGL200406008.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2765047847","display_name":"Yunchou yu guanli","issn_l":"1007-3221","issn":["1007-3221"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4324113244","host_organization_name":"Operations Research Society of China","host_organization_lineage":["https://openalex.org/P4324113244"],"host_organization_lineage_names":["Operations Research Society of China"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Yunchou yu guanli","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5041727379","display_name":"Fanrong Xie","orcid":"https://orcid.org/0000-0001-6958-6431","observed_orcids":["https://orcid.org/0000-0001-6958-6431"]},"institutions":[{"id":"https://openalex.org/I141649914","display_name":"Nanchang University","ror":"https://ror.org/042v6xz23","country_code":"CN","type":"education","lineage":["https://openalex.org/I141649914"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Fanrong Xie","raw_affiliation_strings":["Mathematics Department, Nanchang University, Nanchang 330047, China)"],"raw_orcid":"https://orcid.org/0000-0001-6958-6431","affiliations":[{"raw_affiliation_string":"Mathematics Department, Nanchang University, Nanchang 330047, China)","institution_ids":["https://openalex.org/I141649914"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041727379"],"corresponding_institution_ids":["https://openalex.org/I141649914"],"apc_list":null,"apc_paid":null,"fwci":0.9747,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.76647133,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.8842999935150146,"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.8842999935150146,"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.09030000120401382,"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.005200000014156103,"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/numerical-algorithms","display_name":"numerical algorithms","score":0.8320000171661377},{"id":"https://openalex.org/keywords/optimal-solution","display_name":"optimal solution","score":0.9890000224113464},{"id":"https://openalex.org/keywords/decision-support-system","display_name":"decision support system","score":0.753000020980835},{"id":"https://openalex.org/keywords/convergence","display_name":"convergence","score":0.9350000023841858}],"concepts":[{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.6865761280059814},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6846399307250977},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6324349045753479},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.6324207186698914},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.6059288382530212},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6023492217063904},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5994232892990112},{"id":"https://openalex.org/C165810428","wikidata":"https://www.wikidata.org/wiki/Q6553416","display_name":"Linear bottleneck assignment problem","level":5,"score":0.5188047289848328},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29334259033203125},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2362756247","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-YCGL200406008.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2765047847","display_name":"Yunchou yu guanli","issn_l":"1007-3221","issn":["1007-3221"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4324113244","host_organization_name":"Operations Research Society of China","host_organization_lineage":["https://openalex.org/P4324113244"],"host_organization_lineage_names":["Operations Research Society of China"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Yunchou yu guanli","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4309924327","https://openalex.org/W2923057722","https://openalex.org/W3150442784","https://openalex.org/W2049277541","https://openalex.org/W3044466449","https://openalex.org/W2599397125","https://openalex.org/W1993753096","https://openalex.org/W90023737","https://openalex.org/W4281668797","https://openalex.org/W2914111489"],"abstract_inverted_index":{"For":[0],"the":[1,10,20,29,40,44,48],"convenience":[2],"to":[3,9,43,50],"build":[4],"decision-making":[5],"supporting":[6],"system":[7],"related":[8],"assignment":[11,21,45],"problem,":[12,46],"a":[13],"numerical":[14,60],"algorithm":[15,30],"is":[16,32],"presented":[17],"for":[18],"solving":[19],"problem":[22],"in":[23],"this":[24],"paper\u3002The":[25],"theory,":[26],"on":[27],"which":[28,37],"depends,":[31],"proved":[33],"strictly.":[34],"The":[35],"algorithm,":[36],"can":[38],"find":[39],"optimal":[41],"solution":[42],"has":[47],"merits":[49],"be":[51],"programmed":[52],"easily":[53],"and":[54,58,67],"of":[55],"good":[56],"convergence,":[57],"many":[59],"experiments":[61],"have":[62],"verified":[63],"its":[64],"great":[65],"practicalness":[66],"effectiveness.":[68]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}