{"id":"https://openalex.org/W1944228763","doi":"https://doi.org/10.1016/0305-0548(94)90096-5","title":"The single most vital arc in the most economical path problem\u2014A parametric analysis","display_name":"The single most vital arc in the most economical path problem\u2014A parametric analysis","publication_year":1994,"publication_date":"1994-03-01","ids":{"openalex":"https://openalex.org/W1944228763","doi":"https://doi.org/10.1016/0305-0548(94)90096-5","mag":"1944228763"},"language":"en","primary_location":{"id":"doi:10.1016/0305-0548(94)90096-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0305-0548(94)90096-5","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"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":"Computers & Operations Research","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/A5097253615","display_name":"Lin Kao-Ch\u00eang","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Lin Kao-Ch\u00eang","raw_affiliation_strings":["Department of Industrial Engineering, National Tsing Hua University, Hsinchu 30043, Taiwan, Republic of China"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, National Tsing Hua University, Hsinchu 30043, Taiwan, Republic of China","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5097253616","display_name":"Chern Maw-Sheng","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Chern Maw-Sheng","raw_affiliation_strings":["Department of Industrial Engineering, National Tsing Hua University, Hsinchu 30043, Taiwan, Republic of China"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, National Tsing Hua University, Hsinchu 30043, Taiwan, Republic of China","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5097253616"],"corresponding_institution_ids":["https://openalex.org/I25846049"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.15999446,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"21","issue":"3","first_page":"353","last_page":"358"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9952999949455261,"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.9952999949455261,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9919999837875366,"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/T12176","display_name":"Optimization and Packing Problems","score":0.978600025177002,"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/arc","display_name":"Arc (geometry)","score":0.8122492432594299},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.776733934879303},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7097485065460205},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6231032013893127},{"id":"https://openalex.org/keywords/arc-length","display_name":"Arc length","score":0.5130259394645691},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49909234046936035},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4524586796760559},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.4348585307598114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3158460259437561},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.25537392497062683},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21840211749076843},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11641660332679749},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.054199278354644775},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0496041476726532}],"concepts":[{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.8122492432594299},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.776733934879303},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7097485065460205},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6231032013893127},{"id":"https://openalex.org/C22251595","wikidata":"https://www.wikidata.org/wiki/Q670036","display_name":"Arc length","level":3,"score":0.5130259394645691},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49909234046936035},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4524586796760559},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.4348585307598114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3158460259437561},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.25537392497062683},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21840211749076843},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11641660332679749},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.054199278354644775},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0496041476726532},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0305-0548(94)90096-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0305-0548(94)90096-5","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"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":"Computers & Operations Research","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/W1969625919","https://openalex.org/W1980943820","https://openalex.org/W1994909604","https://openalex.org/W1999293689","https://openalex.org/W2008423363","https://openalex.org/W2010997912","https://openalex.org/W2013627567","https://openalex.org/W2022391611","https://openalex.org/W2027029507","https://openalex.org/W2056940310","https://openalex.org/W2106299112","https://openalex.org/W2614099084","https://openalex.org/W2920966226","https://openalex.org/W3105140593","https://openalex.org/W4210546998","https://openalex.org/W4245095675"],"related_works":["https://openalex.org/W2370345607","https://openalex.org/W2388051136","https://openalex.org/W2171039275","https://openalex.org/W2373818241","https://openalex.org/W2047399896","https://openalex.org/W1967204917","https://openalex.org/W191849398","https://openalex.org/W2767202586","https://openalex.org/W2369626564","https://openalex.org/W569048669"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}