{"id":"https://openalex.org/W2150142009","doi":"https://doi.org/10.1007/978-3-642-77489-8_5","title":"The Linear Assignment Problem","display_name":"The Linear Assignment Problem","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W2150142009","doi":"https://doi.org/10.1007/978-3-642-77489-8_5","mag":"2150142009"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-77489-8_5","doi":"https://doi.org/10.1007/978-3-642-77489-8_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-77489-8_5","pdf_url":null,"source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorial Optimization","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W6921992012","display_name":"Combinatorial Optimization"},"type":"book-chapter","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":null,"display_name":"Mustafa Akg\u00fcl","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Mustafa Akg\u00fcl","raw_affiliation_strings":["Department of Industrial Engineering, Bilkent University, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Bilkent University, Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I168864056"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"85","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9961000084877014,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9961000084877014,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.002099999925121665,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.0005000000237487257,"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/linear-assignment-problem","display_name":"linear assignment problem","score":0.9990000128746033},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.8569999933242798},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.9190000295639038},{"id":"https://openalex.org/keywords/fibonacci-heaps","display_name":"Fibonacci heaps","score":0.8190000057220459},{"id":"https://openalex.org/keywords/sparse-graphs","display_name":"sparse graphs","score":0.7540000081062317},{"id":"https://openalex.org/keywords/dense-graphs","display_name":"dense graphs","score":0.8289999961853027},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.6110000014305115}],"concepts":[{"id":"https://openalex.org/C173734053","wikidata":"https://www.wikidata.org/wiki/Q47577","display_name":"Fibonacci number","level":2,"score":0.809247612953186},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7334818243980408},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6223248243331909},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.583764910697937},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5794757008552551},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48528191447257996},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46840402483940125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4524014890193939},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4455123543739319},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4207432270050049},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3349727988243103},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2576826214790344},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-77489-8_5","doi":"https://doi.org/10.1007/978-3-642-77489-8_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-77489-8_5","pdf_url":null,"source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorial Optimization","raw_type":"book-chapter"},{"id":"pmh:oai:repository.bilkent.edu.tr:11693/52282","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/11693/52282","pdf_url":null,"source":{"id":"https://openalex.org/S4306400079","display_name":"Bilkent University Institutional Repository (Bilkent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I168864056","host_organization_name":"Bilkent University","host_organization_lineage":["https://openalex.org/I168864056"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":69,"referenced_works":["https://openalex.org/W42546367","https://openalex.org/W53596869","https://openalex.org/W136000211","https://openalex.org/W149977709","https://openalex.org/W155400107","https://openalex.org/W586693846","https://openalex.org/W1044267164","https://openalex.org/W1508977476","https://openalex.org/W1513400187","https://openalex.org/W1532372175","https://openalex.org/W1567487011","https://openalex.org/W1963853031","https://openalex.org/W1964119857","https://openalex.org/W1964839903","https://openalex.org/W1974541975","https://openalex.org/W1989124349","https://openalex.org/W1997116158","https://openalex.org/W2009070933","https://openalex.org/W2012044979","https://openalex.org/W2012107091","https://openalex.org/W2013048621","https://openalex.org/W2013108254","https://openalex.org/W2013627567","https://openalex.org/W2018804864","https://openalex.org/W2025806871","https://openalex.org/W2035934281","https://openalex.org/W2037209059","https://openalex.org/W2047029951","https://openalex.org/W2050982038","https://openalex.org/W2053993781","https://openalex.org/W2056178482","https://openalex.org/W2057869046","https://openalex.org/W2058062905","https://openalex.org/W2058923948","https://openalex.org/W2058956837","https://openalex.org/W2061159212","https://openalex.org/W2063317962","https://openalex.org/W2064818612","https://openalex.org/W2066375037","https://openalex.org/W2067045754","https://openalex.org/W2069916913","https://openalex.org/W2073264848","https://openalex.org/W2076554191","https://openalex.org/W2077760188","https://openalex.org/W2084224084","https://openalex.org/W2085917651","https://openalex.org/W2095169634","https://openalex.org/W2095226349","https://openalex.org/W2117350831","https://openalex.org/W2125690626","https://openalex.org/W2127470768","https://openalex.org/W2139688603","https://openalex.org/W2140331394","https://openalex.org/W2141461755","https://openalex.org/W2144050074","https://openalex.org/W2149342630","https://openalex.org/W2155370486","https://openalex.org/W2160365857","https://openalex.org/W2163318198","https://openalex.org/W2169528473","https://openalex.org/W2203446654","https://openalex.org/W2222512263","https://openalex.org/W2285732947","https://openalex.org/W2398887630","https://openalex.org/W2489757015","https://openalex.org/W2768047182","https://openalex.org/W4235060610","https://openalex.org/W4241764762","https://openalex.org/W4246468160"],"related_works":["https://openalex.org/W2139688603","https://openalex.org/W4235771703","https://openalex.org/W2028040632","https://openalex.org/W2061330415","https://openalex.org/W1968368872","https://openalex.org/W2104363966","https://openalex.org/W2055453466","https://openalex.org/W2495273209","https://openalex.org/W3027523559","https://openalex.org/W7097584150"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}