{"id":"https://openalex.org/W2080443364","doi":"https://doi.org/10.1016/0167-6377(93)90102-m","title":"Strongly polynomial time algorithms for certain concave minimization problems on networks","display_name":"Strongly polynomial time algorithms for certain concave minimization problems on networks","publication_year":1993,"publication_date":"1993-09-01","ids":{"openalex":"https://openalex.org/W2080443364","doi":"https://doi.org/10.1016/0167-6377(93)90102-m","mag":"2080443364"},"language":"en","primary_location":{"id":"doi:10.1016/0167-6377(93)90102-m","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(93)90102-m","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","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/A5112758614","display_name":"Ho\u00e0ng T\u1ee5y","orcid":null},"institutions":[{"id":"https://openalex.org/I4210148301","display_name":"Institute of Mathematics","ror":"https://ror.org/04jr71r83","country_code":"VN","type":"facility","lineage":["https://openalex.org/I4210148301","https://openalex.org/I70349855"]},{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE","VN"],"is_corresponding":false,"raw_author_name":"Hoang Tuy","raw_affiliation_strings":["Department of Mathematics, Link\u00f6ping Institute of Technology, S-581 83 Link\u00f6ping, Sweden","Institute of Mathematics, P.O. Box 631, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Link\u00f6ping Institute of Technology, S-581 83 Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Institute of Mathematics, P.O. Box 631, Hanoi, Vietnam","institution_ids":["https://openalex.org/I4210148301"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002925883","display_name":"Nguyen Dinh Dan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nguyen Dinh Dan","raw_affiliation_strings":["Department of Applied Mathematics and Computer Science, Polytechnical Institute, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science, Polytechnical Institute, Hanoi, Vietnam","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043030042","display_name":"Saied Ghannadan","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Saied Ghannadan","raw_affiliation_strings":["Department of Mathematics, Link\u00f6ping Institute of Technology, S-581 83 Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Link\u00f6ping Institute of Technology, S-581 83 Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043030042"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":20.1544,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.99002386,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"14","issue":"2","first_page":"99","last_page":"109"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.980400025844574,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9783999919891357,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.7531067132949829},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.6497483253479004},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6320754289627075},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6143040657043457},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5824982523918152},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5690385103225708},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5484104156494141},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5399342775344849},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5297533273696899},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.4872225821018219},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.473460853099823},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4694960415363312},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4083060324192047}],"concepts":[{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.7531067132949829},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.6497483253479004},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6320754289627075},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6143040657043457},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5824982523918152},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5690385103225708},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5484104156494141},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5399342775344849},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5297533273696899},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.4872225821018219},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.473460853099823},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4694960415363312},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4083060324192047},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0167-6377(93)90102-m","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(93)90102-m","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320327344","display_name":"Marcus och Amalia Wallenbergs minnesfond","ror":"https://ror.org/024f3s581"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1905454362","https://openalex.org/W1963764014","https://openalex.org/W1964389170","https://openalex.org/W1967956032","https://openalex.org/W1968111265","https://openalex.org/W1972029377","https://openalex.org/W1978344132","https://openalex.org/W2019040870","https://openalex.org/W2031494345","https://openalex.org/W2031855518","https://openalex.org/W2034713829","https://openalex.org/W2040254700","https://openalex.org/W2084224084","https://openalex.org/W2163169902","https://openalex.org/W2284408032","https://openalex.org/W2496406001","https://openalex.org/W2584216746","https://openalex.org/W2753176400","https://openalex.org/W4376851360","https://openalex.org/W6655073227","https://openalex.org/W6671329661","https://openalex.org/W6723745419"],"related_works":["https://openalex.org/W3161514703","https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W2098682899","https://openalex.org/W4206915070","https://openalex.org/W2080904092","https://openalex.org/W2531764854","https://openalex.org/W2051329268","https://openalex.org/W1994440468","https://openalex.org/W2593184009"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}