{"id":"https://openalex.org/W10798649","doi":"https://doi.org/10.1007/bf02252026","title":"An augmenting path method for solving Linear Bottleneck Assignment problems","display_name":"An augmenting path method for solving Linear Bottleneck Assignment problems","publication_year":1978,"publication_date":"1978-12-01","ids":{"openalex":"https://openalex.org/W10798649","doi":"https://doi.org/10.1007/bf02252026","mag":"10798649"},"language":"en","primary_location":{"id":"doi:10.1007/bf02252026","doi":"https://doi.org/10.1007/bf02252026","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02252026","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-d","jufo-1","ki-jl-1","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing","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/A5043254346","display_name":"Ulrich Derigs","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"U. Derigs","raw_affiliation_strings":["Mathematisches Institut, Universit\u00e4t zu K\u00f6ln, Weyertal 86-90, D-5000, K\u00f6ln 41, Federal Republic of Germany","Mathematisches Institut, Universit\u00e4t zu K\u00f6ln, K\u00f6ln 41, Federal Republic of Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematisches Institut, Universit\u00e4t zu K\u00f6ln, Weyertal 86-90, D-5000, K\u00f6ln 41, Federal Republic of Germany","institution_ids":["https://openalex.org/I180923762"]},{"raw_affiliation_string":"Mathematisches Institut, Universit\u00e4t zu K\u00f6ln, K\u00f6ln 41, Federal Republic of Germany","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039879204","display_name":"Uwe T. Zimmermann","orcid":"https://orcid.org/0000-0002-1353-8411","observed_orcids":["https://orcid.org/0000-0002-1353-8411"]},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"U. Zimmermann","raw_affiliation_strings":["Mathematisches Institut, Universit\u00e4t zu K\u00f6ln, Weyertal 86-90, D-5000, K\u00f6ln 41, Federal Republic of Germany","Mathematisches Institut, Universit\u00e4t zu K\u00f6ln, K\u00f6ln 41, Federal Republic of Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematisches Institut, Universit\u00e4t zu K\u00f6ln, Weyertal 86-90, D-5000, K\u00f6ln 41, Federal Republic of Germany","institution_ids":["https://openalex.org/I180923762"]},{"raw_affiliation_string":"Mathematisches Institut, Universit\u00e4t zu K\u00f6ln, K\u00f6ln 41, Federal Republic of Germany","institution_ids":["https://openalex.org/I180923762"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I180923762"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":null,"fwci":6.4875,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.96715543,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":96},"biblio":{"volume":"19","issue":"4","first_page":"285","last_page":"295"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.5264000296592712,"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.5264000296592712,"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.4440999925136566,"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.004000000189989805,"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/augmenting-paths","display_name":"augmenting paths","score":0.8500000238418579},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.7990000247955322},{"id":"https://openalex.org/keywords/partial-assignments","display_name":"partial assignments","score":0.6330000162124634},{"id":"https://openalex.org/keywords/heuristic-initialization","display_name":"heuristic initialization","score":0.6039999723434448},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"assignment problem","score":0.5120000243186951},{"id":"https://openalex.org/keywords/fortran-subroutines","display_name":"FORTRAN subroutines","score":0.7990000247955322}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.8726139068603516},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.8395720720291138},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7499587535858154},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5952283143997192},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5939664840698242},{"id":"https://openalex.org/C165810428","wikidata":"https://www.wikidata.org/wiki/Q6553416","display_name":"Linear bottleneck assignment problem","level":5,"score":0.5788520574569702},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5289015173912048},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5225948095321655},{"id":"https://openalex.org/C2778241615","wikidata":"https://www.wikidata.org/wiki/Q83303","display_name":"Fortran","level":2,"score":0.5190825462341309},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4986574649810791},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.44206225872039795},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41555604338645935},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3402032256126404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24820160865783691},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.18381085991859436},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.1412842869758606},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06872794032096863},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"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.1007/bf02252026","doi":"https://doi.org/10.1007/bf02252026","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02252026","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-d","jufo-1","ki-jl-1","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W620038509","https://openalex.org/W1578717571","https://openalex.org/W1989840685","https://openalex.org/W2025806871","https://openalex.org/W2047264521","https://openalex.org/W2130376892","https://openalex.org/W2163318198","https://openalex.org/W2169528473","https://openalex.org/W2222512263","https://openalex.org/W2316240524","https://openalex.org/W2504408008","https://openalex.org/W2725917655","https://openalex.org/W2970617024","https://openalex.org/W4205775998","https://openalex.org/W4235295823"],"related_works":["https://openalex.org/W379628439","https://openalex.org/W53740398","https://openalex.org/W2139688603","https://openalex.org/W2050982038","https://openalex.org/W2318272049","https://openalex.org/W4241476591","https://openalex.org/W408379502","https://openalex.org/W2403014164","https://openalex.org/W3099902940","https://openalex.org/W1978773577"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}