{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T00:51:58Z","timestamp":1660265518266},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0377-2217(99)00092-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T01:35:00Z","timestamp":1027647300000},"page":"561-569","source":"Crossref","is-referenced-by-count":6,"title":["Upper and lower bounding procedures for minimum rooted k-subtree problem"],"prefix":"10.1016","volume":"122","author":[{"given":"Seiji","family":"Kataoka","sequence":"first","affiliation":[]},{"given":"Norio","family":"Araki","sequence":"additional","affiliation":[]},{"given":"Takeo","family":"Yamada","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00092-2_BIB1","unstructured":"R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, NJ, 1993"},{"key":"10.1016\/S0377-2217(99)00092-2_BIB2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0377-2217(93)E0362-2","article-title":"Search \u2013 hide games on trees","volume":"80","author":"Cao","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00092-2_BIB3","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(96)00084-7","article-title":"K-TREE\/K-SUBGRAPH: A program package for minimal weighted k-cardinality trees and subgraph","volume":"93","author":"Ehrgott","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00092-2_BIB4","first-page":"87","article-title":"Heuristics for the k-cardinality tree and subgraph problems","volume":"14","author":"Ehrgott","year":"1997","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00092-2_BIB5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/net.3230240103","article-title":"Weighted k-cardinality trees: Complexity and polyhedral structure","volume":"24","author":"Fischetti","year":"1994","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00092-2_BIB6","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H.Freeman and Company, San Francisco, CA, 1978"},{"key":"10.1016\/S0377-2217(99)00092-2_BIB7","first-page":"9","article-title":"Tabu search for weighted k-cardinality trees","volume":"14","author":"J\u00f6rnsten","year":"1997","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00092-2_BIB8","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/0377-2217(94)00335-1","article-title":"A heuristic algorithm for the mini-max spanning forest problem","volume":"91","author":"Yamada","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00092-2_BIB9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0377-2217(96)00155-5","article-title":"A branch-and-bound algorithm for the mini-max spanning forest problem","volume":"101","author":"Yamada","year":"1997","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799000922?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799000922?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T15:56:16Z","timestamp":1555343776000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799000922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0377221799000922"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00092-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}