{"id":"https://openalex.org/W1987095267","doi":"https://doi.org/10.1007/bf02614372","title":"Multiflows and disjoint paths of minimum total cost","display_name":"Multiflows and disjoint paths of minimum total cost","publication_year":1997,"publication_date":"1997-08-01","ids":{"openalex":"https://openalex.org/W1987095267","doi":"https://doi.org/10.1007/bf02614372","mag":"1987095267"},"language":"en","primary_location":{"id":"doi:10.1007/bf02614372","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02614372","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/A5111563320","display_name":"Alexander V. Karzanov","orcid":null},"institutions":[{"id":"https://openalex.org/I4210115688","display_name":"Institute for Systems Analysis","ror":"https://ror.org/02kmet255","country_code":"RU","type":"facility","lineage":["https://openalex.org/I4210115688"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Alexander V. Karzanov","raw_affiliation_strings":["Institute for System Analysis of Russian Acad. Sci., 9, Prospect 60 Let Oktyabrya, 117312, Moscow, Russia","Institute for System Analysis of Russian Acad. Sci., Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Institute for System Analysis of Russian Acad. Sci., 9, Prospect 60 Let Oktyabrya, 117312, Moscow, Russia","institution_ids":["https://openalex.org/I4210115688"]},{"raw_affiliation_string":"Institute for System Analysis of Russian Acad. Sci., Moscow, Russia","institution_ids":["https://openalex.org/I4210115688"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111563320"],"corresponding_institution_ids":["https://openalex.org/I4210115688"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0322,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.74535232,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"78","issue":"2","first_page":"219","last_page":"242"},"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.9994999766349792,"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.9994999766349792,"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.9991000294685364,"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.9976000189781189,"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/mathematics","display_name":"Mathematics","score":0.7817361950874329},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7542349100112915},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6425864696502686},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.6366895437240601},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.493238627910614},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.4888760447502136},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4612717628479004},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4490165114402771},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44839727878570557},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.4233327805995941},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.41908296942710876},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3450731635093689},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14808893203735352}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7817361950874329},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7542349100112915},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6425864696502686},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.6366895437240601},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.493238627910614},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.4888760447502136},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4612717628479004},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4490165114402771},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44839727878570557},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.4233327805995941},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.41908296942710876},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3450731635093689},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14808893203735352},{"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf02614372","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02614372","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:ddd.uab.cat:117","is_oa":false,"landing_page_url":"https://ddd.uab.cat/record/117","pdf_url":null,"source":{"id":"https://openalex.org/S4306400380","display_name":"Dip\u00f2sit Digital de Documents de la UAB (Universitat Aut\u00f2noma de Barcelona)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I123044942","host_organization_name":"Universitat Aut\u00f2noma de Barcelona","host_organization_lineage":["https://openalex.org/I123044942"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W61956116","https://openalex.org/W605736217","https://openalex.org/W1552561242","https://openalex.org/W1563039933","https://openalex.org/W1964119857","https://openalex.org/W1977545325","https://openalex.org/W1980961524","https://openalex.org/W1986334784","https://openalex.org/W2000743971","https://openalex.org/W2003160050","https://openalex.org/W2033040247","https://openalex.org/W2037823059","https://openalex.org/W2041636300","https://openalex.org/W2064284095","https://openalex.org/W2079410153","https://openalex.org/W2100440346","https://openalex.org/W2103370757","https://openalex.org/W2103985627","https://openalex.org/W2149342630","https://openalex.org/W2150815458","https://openalex.org/W2169798930","https://openalex.org/W2327315803","https://openalex.org/W2599087550","https://openalex.org/W2599477347","https://openalex.org/W4247927012"],"related_works":["https://openalex.org/W2088925915","https://openalex.org/W2382891957","https://openalex.org/W2393491644","https://openalex.org/W2067184662","https://openalex.org/W3047837489","https://openalex.org/W2104496206","https://openalex.org/W2622139626","https://openalex.org/W2133660117","https://openalex.org/W3013303285","https://openalex.org/W2385836742"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}