{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:22:17Z","timestamp":1772792537755,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998,1]]},"DOI":"10.1016\/s0377-2217(96)00327-x","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"250-261","source":"Crossref","is-referenced-by-count":36,"title":["Minimal spanning trees with a constraint on the number of leaves"],"prefix":"10.1016","volume":"104","author":[{"given":"Lucinda Matos","family":"Fernandes","sequence":"first","affiliation":[]},{"given":"Luis","family":"Gouveia","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(96)00327-X_BIB1","first-page":"346","article-title":"Optimum branchings in mathematics of the decision sciences","author":"Edmonds","year":"1968"},{"key":"10.1016\/S0377-2217(96)00327-X_BIB2","article-title":"O problema da \u00e1rvore de suporte de custo m\u00ednimo com uma restri\u00e7\u00e3o adicional no n\u00famero de folhas","author":"Fernandes","year":"1994"},{"key":"10.1016\/S0377-2217(96)00327-X_BIB3","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.5.4.426","article-title":"An efficient algorithm for the min-sum arborescence problem on complete digraphs","volume":"5","author":"Fischetti","year":"1993","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(96)00327-X_BIB4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0020-0190(94)90139-2","article-title":"A short note on the approximability of the maximum leaves spanning tree problem","volume":"52","author":"Galbiati","year":"1994","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0377-2217(96)00327-X_BIB5","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(96)00327-X_BIB6","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","article-title":"Topological design of centralized computer networks: Formulations and algorithms","volume":"12","author":"Gavish","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(96)00327-X_BIB7","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1109\/TCOM.1985.1096250","article-title":"Augmented Lagrangean based algorithms for centralized network design","volume":"Com-33","author":"Gavish","year":"1985","journal-title":"IEEE Trans. on Comm."},{"key":"10.1016\/S0377-2217(96)00327-X_BIB8","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangean relaxation for integer programming","volume":"2","author":"Geoffrion","year":"1976","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0377-2217(96)00327-X_BIB9","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.43.1.130","article-title":"A 2n-constraint formulation for the capacitated minimal spanning tree problem","volume":"43","author":"Gouveia","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(96)00327-X_BIB10","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/0377-2217(95)00090-9","article-title":"Multicommodity flow models for spanning trees with Hop constraints","volume":"95","author":"Gouveia","year":"1996","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0377-2217(96)00327-X_BIB11","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(96)00327-X_BIB12","series-title":"Proc. Allerton Conf.","first-page":"533","article-title":"The power of local optimization: Approximation algorithms for maximum-leaf spanning tree","author":"Lu","year":"1992"},{"key":"10.1016\/S0377-2217(96)00327-X_BIB13","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalization","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech Journal"},{"key":"10.1016\/S0377-2217(96)00327-X_BIB14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0377-2217(89)90169-0","article-title":"A Lagrangean approach to the degree-constrained minimum spanning tree problem","volume":"39","author":"Volgenant","year":"1989","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:S037722179600327X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179600327X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T08:54:34Z","timestamp":1556096074000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722179600327X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S037722179600327X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(96)00327-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}