{"id":"https://openalex.org/W1973431384","doi":"https://doi.org/10.1007/bf01585711","title":"A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure","display_name":"A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W1973431384","doi":"https://doi.org/10.1007/bf01585711","mag":"1973431384"},"language":"en","primary_location":{"id":"doi:10.1007/bf01585711","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01585711","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/A5041708435","display_name":"Phan Thi\u00ean Thach","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"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Phan Thien Thach","raw_affiliation_strings":["Institute of Mathematics, PO Box 631, Boho, Hanoi, Vietnam","Institute of Mathematics, Boho, Hanoi, Vietnam#TAB#"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, PO Box 631, Boho, Hanoi, Vietnam","institution_ids":["https://openalex.org/I4210148301"]},{"raw_affiliation_string":"Institute of Mathematics, Boho, Hanoi, Vietnam#TAB#","institution_ids":["https://openalex.org/I4210148301"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041708435"],"corresponding_institution_ids":["https://openalex.org/I4210148301"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.9593,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.72483141,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"53","issue":"1-3","first_page":"339","last_page":"359"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9904000163078308,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9904000163078308,"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/T11830","display_name":"Point processes and geometric inequalities","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.98580002784729,"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/decomposition","display_name":"Decomposition","score":0.6952052712440491},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6740611791610718},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6407960653305054},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5923290252685547},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.5425591468811035},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5049715638160706},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.46862274408340454},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4592544734477997},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.44764918088912964},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09328553080558777}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6952052712440491},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6740611791610718},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6407960653305054},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5923290252685547},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.5425591468811035},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5049715638160706},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.46862274408340454},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4592544734477997},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.44764918088912964},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09328553080558777},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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.1007/bf01585711","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01585711","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W608362671","https://openalex.org/W1481747975","https://openalex.org/W1579943307","https://openalex.org/W1986757220","https://openalex.org/W1987335601","https://openalex.org/W1996431511","https://openalex.org/W2002603218","https://openalex.org/W2016218947","https://openalex.org/W2082736860","https://openalex.org/W2096586036","https://openalex.org/W2157924277","https://openalex.org/W2172121397","https://openalex.org/W4249667877","https://openalex.org/W4388285403"],"related_works":["https://openalex.org/W3141113327","https://openalex.org/W2080904092","https://openalex.org/W3035974271","https://openalex.org/W3161514703","https://openalex.org/W3207627914","https://openalex.org/W2270959725","https://openalex.org/W2151525839","https://openalex.org/W648253840","https://openalex.org/W2051329268","https://openalex.org/W2092572272"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}