{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T19:43:01Z","timestamp":1770320581909,"version":"3.49.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"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":[[1982,1]]},"DOI":"10.1016\/0305-0548(82)90026-0","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"287-296","source":"Crossref","is-referenced-by-count":68,"title":["Minimal spanning tree subject to a side constraint"],"prefix":"10.1016","volume":"9","author":[{"given":"V.","family":"Aggarwal","sequence":"first","affiliation":[]},{"given":"Y.P.","family":"Aneja","sequence":"additional","affiliation":[]},{"given":"K.P.K.","family":"Nair","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(82)90026-0_BIB1","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0305-0548(82)90026-0_BIB2","first-page":"48","article-title":"On the shortest spanning subtree of a graph and the travelling salesman problem","volume":"7","author":"Kruskal","year":"1956"},{"key":"10.1016\/0305-0548(82)90026-0_BIB3","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 Systems Tech. J."},{"key":"10.1016\/0305-0548(82)90026-0_BIB4","first-page":"21","article-title":"An O\u00a6E\u00a6log log\u00a6V\u00a6 algorithm for finding minimum spanning trees","volume":"4","author":"Yao","year":"1975"},{"key":"10.1016\/0305-0548(82)90026-0_BIB5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1137\/0206011","article-title":"Two algorithms for generating weighted spanning trees in order","volume":"6","author":"Gabow","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/0305-0548(82)90026-0_BIB6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","article-title":"Optimum branchings","volume":"71B","author":"Edmonds","year":"1967","journal-title":"Nat Bur Stds. J. Res."},{"key":"10.1016\/0305-0548(82)90026-0_BIB7","unstructured":"J. W. Suurballe, Minimal spanning tree algorithm and the dual simplex method. Bell Lab Tech. Memo."},{"key":"10.1016\/0305-0548(82)90026-0_BIB8","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1287\/mnsc.18.7.406","article-title":"Multiparametric linear programming","volume":"18","author":"Gal","year":"1972","journal-title":"Mgt. Sci."},{"key":"10.1016\/0305-0548(82)90026-0_BIB9","series-title":"Linear Multiobjective Programming","author":"Zeleny","year":"1974"},{"key":"10.1016\/0305-0548(82)90026-0_BIB10","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230070405","article-title":"Minimal ratio spanning tree","volume":"7","author":"Chandrasekaran","year":"1977","journal-title":"Networks"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054882900260?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054882900260?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:29:24Z","timestamp":1552926564000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054882900260"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,1]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,1]]}},"alternative-id":["0305054882900260"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(82)90026-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1982,1]]}}}