{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:20:06Z","timestamp":1761805206002},"reference-count":21,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0305-0548(00)00083-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:26:50Z","timestamp":1027607210000},"page":"441-458","source":"Crossref","is-referenced-by-count":26,"title":["The cable trench problem: combining the shortest path and minimum spanning tree problems"],"prefix":"10.1016","volume":"29","author":[{"given":"Francis J.","family":"Vasko","sequence":"first","affiliation":[]},{"given":"Robert S.","family":"Barbieri","sequence":"additional","affiliation":[]},{"given":"Brian Q.","family":"Rieksts","sequence":"additional","affiliation":[]},{"given":"Kenneth L.","family":"Reitmeyer","sequence":"additional","affiliation":[]},{"suffix":"Jr.","given":"Kenneth L.","family":"Stott","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00083-6_BIB1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01187017","article-title":"A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs","volume":"11","author":"Booth","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB2","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/S0305-0548(99)00061-1","article-title":"A constrained minimum spanning tree problem","volume":"27","author":"Chen","year":"2000","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB3","series-title":"Combinatorial optimization","author":"Cook","year":"1998"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB4","series-title":"Introduction to algorithms","author":"Cormen","year":"1994"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB6","unstructured":"Eppstein D. Shortest path along an MST. Computational Theory 1999."},{"key":"10.1016\/S0305-0548(00)00083-6_BIB7","doi-asserted-by":"crossref","unstructured":"Eppstein D. Email communication, June 3, 1999.","DOI":"10.1016\/S0925-7721(98)00032-7"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB8","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB9","series-title":"Graph theory and its applications","author":"Gross","year":"1999"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB10","series-title":"Introduction to operations research","author":"Hillier","year":"1995"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB11","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01294129","article-title":"Balancing minimum spanning trees and shortest-path trees","volume":"14","author":"Khuller","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB12","first-page":"48","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"7\/1","author":"Kruskal","year":"1956","journal-title":"Proceedings of ACM"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB13","series-title":"Integer and combinatorial optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB14","series-title":"Combinatorial optimization: algorithms and complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB15","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB16","series-title":"Discrete mathematics and its applications","author":"Rosen","year":"1991"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB17","unstructured":"Saltzman MJ. Counterexample to minimum spanning tree = shortest path tree? Usenet News Group Sci.op-research, 31 May 1995."},{"key":"10.1016\/S0305-0548(00)00083-6_BIB18","series-title":"Operations research: applications and algorithms","author":"Winston","year":"1994"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB19","series-title":"Introduction to mathematical programming: applications and algorithms","author":"Winston","year":"1995"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB20","series-title":"Integer programming","author":"Wolsey","year":"1998"},{"key":"10.1016\/S0305-0548(00)00083-6_BIB21","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0377-2217(98)00016-2","article-title":"Genetic algorithm approach on multi-criteria minimum spanning tree problem","volume":"114","author":"Zhou","year":"1999","journal-title":"European Journal of Operational Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000836?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000836?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T09:04:29Z","timestamp":1578560669000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0305054800000836"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00083-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}