{"id":"https://openalex.org/W2032419831","doi":"https://doi.org/10.1007/bf01585755","title":"A strongly polynomial algorithm for the transportation problem","display_name":"A strongly polynomial algorithm for the transportation problem","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W2032419831","doi":"https://doi.org/10.1007/bf01585755","mag":"2032419831"},"language":"en","primary_location":{"id":"doi:10.1007/bf01585755","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01585755","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"Mathematical Programming","raw_type":"journal-article"},"type":"article","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/A5066056236","display_name":"Peter Kleinschmidt","orcid":"https://orcid.org/0000-0001-8812-9260"},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"P. Kleinschmidt","raw_affiliation_strings":["Wirtschaftswissenschaftliche Fakult\u00e4t, Universit\u00e4t Passau, Innstrasse 29, D-94030, Passau, Germany","Wirtschaftswissenschaftliche Fakult\u00e4t, Universit\u00e4t Passau, Passau, Germany"],"affiliations":[{"raw_affiliation_string":"Wirtschaftswissenschaftliche Fakult\u00e4t, Universit\u00e4t Passau, Innstrasse 29, D-94030, Passau, Germany","institution_ids":["https://openalex.org/I186354981"]},{"raw_affiliation_string":"Wirtschaftswissenschaftliche Fakult\u00e4t, Universit\u00e4t Passau, Passau, Germany","institution_ids":["https://openalex.org/I186354981"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028513946","display_name":"Heinz Schannath","orcid":null},"institutions":[{"id":"https://openalex.org/I202702066","display_name":"Landesbank Baden-W\u00fcrttemberg","ror":"https://ror.org/0208vms90","country_code":"DE","type":"other","lineage":["https://openalex.org/I202702066"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"H. Schannath","raw_affiliation_strings":["Westdeutsche Landesbank, Mathematische Beratung, D-40217, D\u00fcsseldorf, Germany","Westdeutsche Landesbank, Mathematische Beratung, D\u00fcsseldorf, Germany"],"affiliations":[{"raw_affiliation_string":"Westdeutsche Landesbank, Mathematische Beratung, D-40217, D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I202702066"]},{"raw_affiliation_string":"Westdeutsche Landesbank, Mathematische Beratung, D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I202702066"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066056236"],"corresponding_institution_ids":["https://openalex.org/I186354981"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.16199616,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"68","issue":"1-3","first_page":"1","last_page":"13"},"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.9995999932289124,"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.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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/T12288","display_name":"Optimization and Search Problems","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/transportation-theory","display_name":"Transportation theory","score":0.7592421174049377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6196340322494507},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.5819953083992004},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5266625285148621},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48029252886772156},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.479579359292984},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4681910276412964},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.46321943402290344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4569779336452484},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44732874631881714},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4067835211753845},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09398871660232544},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07991907000541687}],"concepts":[{"id":"https://openalex.org/C31829261","wikidata":"https://www.wikidata.org/wiki/Q1929885","display_name":"Transportation theory","level":2,"score":0.7592421174049377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6196340322494507},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.5819953083992004},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5266625285148621},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48029252886772156},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.479579359292984},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4681910276412964},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.46321943402290344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4569779336452484},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44732874631881714},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4067835211753845},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09398871660232544},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07991907000541687}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf01585755","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01585755","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-004220925","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1552561242","https://openalex.org/W1563039933","https://openalex.org/W2056991815","https://openalex.org/W2077760188","https://openalex.org/W2084224084","https://openalex.org/W2090220859","https://openalex.org/W2095169634","https://openalex.org/W2117157235","https://openalex.org/W3123221209","https://openalex.org/W7051703301"],"related_works":["https://openalex.org/W2278302102","https://openalex.org/W2351723118","https://openalex.org/W2392507953","https://openalex.org/W2103510479","https://openalex.org/W2372917735","https://openalex.org/W2775835424","https://openalex.org/W2254995460","https://openalex.org/W2213850920","https://openalex.org/W2036901247","https://openalex.org/W592655573"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}