{"id":"https://openalex.org/W1997556033","doi":"https://doi.org/10.1002/net.3230220705","title":"Finding disjoint paths with different path\u2010costs: Complexity and algorithms","display_name":"Finding disjoint paths with different path\u2010costs: Complexity and algorithms","publication_year":1992,"publication_date":"1992-12-01","ids":{"openalex":"https://openalex.org/W1997556033","doi":"https://doi.org/10.1002/net.3230220705","mag":"1997556033"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230220705","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220705","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5011588648","display_name":"Chung\u2010Lun Li","orcid":"https://orcid.org/0000-0002-4225-0855"},"institutions":[{"id":"https://openalex.org/I125068653","display_name":"IE University","ror":"https://ror.org/02jjdwm75","country_code":"ES","type":"education","lineage":["https://openalex.org/I125068653"]},{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["ES","US"],"is_corresponding":true,"raw_author_name":"Chung\u2010Lun Li","raw_affiliation_strings":["John M. Olin School of Business Washington University St. Louis, Missouri 63130","Work done in part in the IE/OR Department at Columbia University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"John M. Olin School of Business Washington University St. Louis, Missouri 63130","institution_ids":["https://openalex.org/I204465549"]},{"raw_affiliation_string":"Work done in part in the IE/OR Department at Columbia University","institution_ids":["https://openalex.org/I125068653"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079981879","display_name":"S. Thomas McCormick","orcid":"https://orcid.org/0000-0002-2828-4100"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"S. Thomas McCormick","raw_affiliation_strings":["Faculty of Commerce and Business Administration University of British Columbia Vancouver, B.C. V6T 1Y8, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Commerce and Business Administration University of British Columbia Vancouver, B.C. V6T 1Y8, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112431388","display_name":"David Simchi\u2010Levi","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Simchi\u2010Levi","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research Columbia University New York, New York 10027"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research Columbia University New York, New York 10027","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5011588648"],"corresponding_institution_ids":["https://openalex.org/I125068653","https://openalex.org/I204465549"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.0344,"has_fulltext":false,"cited_by_count":83,"citation_normalized_percentile":{"value":0.76911408,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"22","issue":"7","first_page":"653","last_page":"667"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9883999824523926,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9835000038146973,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7397774457931519},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7005805969238281},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6994152069091797},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6434126496315002},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5908840894699097},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5487247109413147},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5176918506622314},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4953531324863434},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.49204036593437195},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.46841397881507874},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.44500190019607544},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4398965537548065},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40499550104141235},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3978840410709381},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3484301269054413},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2856293320655823},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22094887495040894},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.18905293941497803}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7397774457931519},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7005805969238281},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6994152069091797},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6434126496315002},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5908840894699097},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5487247109413147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5176918506622314},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4953531324863434},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.49204036593437195},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.46841397881507874},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.44500190019607544},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4398965537548065},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40499550104141235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3978840410709381},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3484301269054413},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2856293320655823},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22094887495040894},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.18905293941497803},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230220705","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220705","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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":16,"referenced_works":["https://openalex.org/W1967565181","https://openalex.org/W1976285925","https://openalex.org/W2000733920","https://openalex.org/W2003160050","https://openalex.org/W2011039300","https://openalex.org/W2019637647","https://openalex.org/W2048236984","https://openalex.org/W2059563583","https://openalex.org/W2119337515","https://openalex.org/W2154434560","https://openalex.org/W2155061423","https://openalex.org/W2338905098","https://openalex.org/W2569646339","https://openalex.org/W2610202827","https://openalex.org/W2799004609","https://openalex.org/W6662626567"],"related_works":["https://openalex.org/W143702185","https://openalex.org/W1988947197","https://openalex.org/W4255598955","https://openalex.org/W2953710272","https://openalex.org/W3088611359","https://openalex.org/W2372392972","https://openalex.org/W1643271191","https://openalex.org/W3006501763","https://openalex.org/W4300501056","https://openalex.org/W2765600275"],"abstract_inverted_index":{"Abstract":[0],"Consider":[1],"a":[2,103],"network":[3,71],"G":[4],"=":[5,92],"(V,E)":[6],"with":[7,15,52],"distinguished":[8],"vertices":[9],"s":[10,32],"and":[11,14,69,102],"t":[12,34],",":[13],"k":[16,28,91],"different":[17],"costs":[18],"on":[19],"every":[20],"edge.":[21],"We":[22,77,94],"consider":[23],"the":[24,37,41,46,53,70,84,100,108],"problem":[25,58,85,101],"of":[26,40,83],"finding":[27],"disjoint":[29],"paths":[30,42,63],"from":[31],"to":[33],"such":[35],"that":[36,79],"total":[38],"cost":[39],"is":[43,50],"minimized,":[44],"where":[45],"j":[47,54],"th":[48,55],"edge\u2010cost":[49],"associated":[51],"path.":[56],"The":[57,62],"has":[59],"several":[60],"variants:":[61],"may":[64,72],"be":[65,73],"vertex\u2010disjoint":[66],"or":[67,75],"arc\u2010disjoint":[68],"directed":[74,110],"undirected.":[76],"show":[78],"all":[80],"four":[81],"versions":[82],"are":[86],"strongly":[87],"NP\u2010complete":[88],"even":[89],"for":[90,99,107],"2.":[93],"describe":[95],"polynomial":[96,104],"time":[97,105],"heuristics":[98],"algorithm":[106],"acyclic":[109],"case.":[111]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}