{"id":"https://openalex.org/W2146459980","doi":"https://doi.org/10.1016/s0305-0548(00)00083-6","title":"The cable trench problem: combining the shortest path and minimum spanning tree problems","display_name":"The cable trench problem: combining the shortest path and minimum spanning tree problems","publication_year":2002,"publication_date":"2002-04-01","ids":{"openalex":"https://openalex.org/W2146459980","doi":"https://doi.org/10.1016/s0305-0548(00)00083-6","mag":"2146459980"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(00)00083-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(00)00083-6","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/A5014061236","display_name":"Francis J. Vasko","orcid":"https://orcid.org/0000-0001-8975-0999"},"institutions":[{"id":"https://openalex.org/I2132711","display_name":"Kutztown University","ror":"https://ror.org/056veft20","country_code":"US","type":"education","lineage":["https://openalex.org/I2132711"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Francis J. Vasko","raw_affiliation_strings":["Mathematics & CIS Department, Kutztown University, Kutztown, PA, and Homer Research Laboratories, Bethlehem Steel Corporation, Bethlehem, PA"],"affiliations":[{"raw_affiliation_string":"Mathematics & CIS Department, Kutztown University, Kutztown, PA, and Homer Research Laboratories, Bethlehem Steel Corporation, Bethlehem, PA","institution_ids":["https://openalex.org/I2132711"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046529652","display_name":"Robert S. Barbieri","orcid":null},"institutions":[{"id":"https://openalex.org/I2132711","display_name":"Kutztown University","ror":"https://ror.org/056veft20","country_code":"US","type":"education","lineage":["https://openalex.org/I2132711"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert S. Barbieri","raw_affiliation_strings":["Mathematics & CIS Department, Kutztown University, Kutztown, PA#TAB#"],"affiliations":[{"raw_affiliation_string":"Mathematics & CIS Department, Kutztown University, Kutztown, PA#TAB#","institution_ids":["https://openalex.org/I2132711"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066125445","display_name":"Brian Q. Rieksts","orcid":null},"institutions":[{"id":"https://openalex.org/I2132711","display_name":"Kutztown University","ror":"https://ror.org/056veft20","country_code":"US","type":"education","lineage":["https://openalex.org/I2132711"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian Q. Rieksts","raw_affiliation_strings":["Mathematics & CIS Department, Kutztown University, Kutztown, PA#TAB#"],"affiliations":[{"raw_affiliation_string":"Mathematics & CIS Department, Kutztown University, Kutztown, PA#TAB#","institution_ids":["https://openalex.org/I2132711"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022900780","display_name":"Kenneth L. Reitmeyer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kenneth L. Reitmeyer","raw_affiliation_strings":["Homer Research Laboratories Bethlehem Steel Corp. Bethlehem, PA"],"affiliations":[{"raw_affiliation_string":"Homer Research Laboratories Bethlehem Steel Corp. Bethlehem, PA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022315418","display_name":"Kenneth L. Stott","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kenneth L. Stott","raw_affiliation_strings":["Homer Research Laboratories Bethlehem Steel Corp. Bethlehem, PA"],"affiliations":[{"raw_affiliation_string":"Homer Research Laboratories Bethlehem Steel Corp. Bethlehem, PA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5014061236"],"corresponding_institution_ids":["https://openalex.org/I2132711"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.29591675,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"29","issue":"5","first_page":"441","last_page":"458"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9743000268936157,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T12546","display_name":"Smart Parking Systems Research","score":0.9743000268936157,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.972599983215332,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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.964900016784668,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7221637964248657},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7061575651168823},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6901748180389404},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5974918603897095},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5736566781997681},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5659749507904053},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5551660656929016},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5086506009101868},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5064753293991089},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.318562388420105},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23275282979011536},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2243359386920929},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21109744906425476},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1507444679737091},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10212904214859009}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7221637964248657},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7061575651168823},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6901748180389404},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5974918603897095},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5736566781997681},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5659749507904053},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5551660656929016},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5086506009101868},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5064753293991089},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.318562388420105},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23275282979011536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2243359386920929},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21109744906425476},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1507444679737091},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10212904214859009}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0305-0548(00)00083-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(00)00083-6","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W94213613","https://openalex.org/W1547784515","https://openalex.org/W1567268701","https://openalex.org/W1965680834","https://openalex.org/W1968143987","https://openalex.org/W2005362242","https://openalex.org/W2011039300","https://openalex.org/W2017797336","https://openalex.org/W2017927472","https://openalex.org/W2053913299","https://openalex.org/W2069323107","https://openalex.org/W2077823485","https://openalex.org/W2078199146","https://openalex.org/W2169528473","https://openalex.org/W2336259629","https://openalex.org/W2340149117","https://openalex.org/W2400908863","https://openalex.org/W2595833503","https://openalex.org/W2751335644","https://openalex.org/W2752885492","https://openalex.org/W2753693129","https://openalex.org/W2912706550","https://openalex.org/W2951475756","https://openalex.org/W2951898071","https://openalex.org/W3135604143","https://openalex.org/W4211015501","https://openalex.org/W4285719527","https://openalex.org/W6641692026"],"related_works":["https://openalex.org/W4224251989","https://openalex.org/W2071845176","https://openalex.org/W2146459980","https://openalex.org/W1492843964","https://openalex.org/W4220861011","https://openalex.org/W2914161519","https://openalex.org/W2999962451","https://openalex.org/W1514905840","https://openalex.org/W2203860513","https://openalex.org/W4206303798"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}