{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T12:02:07Z","timestamp":1709208127565},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1007\/bf01585993","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:35:26Z","timestamp":1114677326000},"page":"113-126","source":"Crossref","is-referenced-by-count":6,"title":["Optimizing constrained subtrees of trees"],"prefix":"10.1007","volume":"71","author":[{"given":"El Houssaine","family":"Aghezzaf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas L.","family":"Magnanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurence A.","family":"Wolsey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Optimal constrained rooted subtrees and partitioning problems on tree graphs","author":"E.H. Aghezzaf","year":"1992","unstructured":"E.H. Aghezzaf, \u201cOptimal constrained rooted subtrees and partitioning problems on tree graphs,\u201d Doctoral thesis, Facult\u00e9 des Sciences, Universit\u00e9 Catholique de Louvain (Louvain-la-Neuve, Belgium, 1992)."},{"key":"CR2","series-title":"CORE Discussion Paper","volume-title":"Optimizing constrained subtreed of trees","author":"E.H. Aghezzaf","year":"1992","unstructured":"E.H. Aghezzaf, T.L. Magnanti and L.A. Wolsey, \u201cOptimizing constrained subtreed of trees,\u201d CORE Discussion Paper 9250, Universit\u00e9 Catholique de Louvain (Louvain-la-Neuve, Belgium, 1992)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0166-218X(92)00168-L","volume":"50","author":"E.H. Aghezzaf","year":"1994","unstructured":"E.H. Aghezzaf and L.A. Wolsey, \u201cModelling piecewise linear concave costs in a tree partitioning problem,\u201dDiscrete Applied Mathematics 50 (1994) 101\u2013109.","journal-title":"Discrete Applied Mathematics"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/opre.43.1.58","volume":"43","author":"A. Balakrishnan","year":"1995","unstructured":"A. Balakrishnan, T.L. Magnanti and R.T. Wong, \u201cA decomposition algorithm for expanding local access telecommunications networks,\u201dOperations Research 43 (1995) 58\u201376.","journal-title":"Operations Research"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF02579383","volume":"6","author":"I. Barany","year":"1986","unstructured":"I. Barany, J. Edmonds and L.A. Wolsey, \u201cPacking and covering a tree by subtrees,\u201dCombinatorica 6 (1986) 245\u2013257.","journal-title":"Combinatorica"},{"key":"CR6","unstructured":"E.A. Boyd, \u201cPolyhedral results for the precedence constrained knapsack problem,\u201dProceedings of IPCO1 (Waterloo University Press, 1990)."},{"key":"CR7","series-title":"CORE Discussion Paper","volume-title":"The node capacitated graph partitioning problem: A computational study","author":"C.E. Ferreira","year":"1994","unstructured":"C.E. Ferreira, A. Martin, C.C. de Souza, R. Weismantel and L.A. Wolsey, \u201cThe node capacitated graph partitioning problem: A computational study,\u201d CORE Discussion Paper 9453, Universit\u00e9 Catholique de Louvain (Louvain-la-Neuve, Belgium, 1994)."},{"key":"CR8","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic,Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980)."},{"key":"CR9","first-page":"121","volume":"16","author":"H. Groeflin","year":"1982","unstructured":"H. Groeflin, T.M. Liebling and A. Prodon, \u201cOptimal subtrees and extensions,\u201dAnnals of Discrete Mathematics 16 (1982) 121\u2013127.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.8.1.1","volume":"8","author":"D.S. Johnson","year":"1983","unstructured":"D.S. Johnson and K.A. Niemy, \u201cOn knapsacks, partitions and a new dynamic programming technique for trees,\u201dMathematics of Operations Research 8 (1983) 1\u201314.","journal-title":"Mathematics of Operations Research"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1147\/rd.183.0217","volume":"18","author":"J.A. Lukes","year":"1974","unstructured":"J.A. Lukes, \u201cEfficient algorithm for the partitioning of trees,\u201dIBM Journal of Research and Development 18 (1974) 217\u2013224.","journal-title":"IBM Journal of Research and Development"},{"key":"CR12","volume-title":"Discrete Location Theory","author":"P.B. Mirchandani","year":"1990","unstructured":"P.B. Mirchandani and R.L. Francis,Discrete Location Theory (Wiley, New York, 1990)."},{"key":"CR13","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988)."},{"key":"CR14","unstructured":"J.E. Ward, R.T. Wong, P. Lemke and A. Oudjit, \u201cProperties of the tree K-median linear programming relaxation,\u201d Research Report CC-878-29, Institute for Interdisciplinary Engineering Studies, Purdue University (1987)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585993.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585993\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585993","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T08:16:21Z","timestamp":1706170581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585993"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF01585993"],"URL":"https:\/\/doi.org\/10.1007\/bf01585993","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}