{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T08:57:06Z","timestamp":1707987426341},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"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,3]]},"DOI":"10.1016\/s0377-2217(99)00043-0","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"394-411","source":"Crossref","is-referenced-by-count":6,"title":["Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs"],"prefix":"10.1016","volume":"121","author":[{"given":"Luis","family":"Gouveia","sequence":"first","affiliation":[]},{"given":"Maria Jo\u00e3o","family":"Lopes","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00043-0_BIB1","first-page":"9","article-title":"Capacitated minimum spanning trees: Algorithms using intelligent search","volume":"1","author":"Amberg","year":"1996","journal-title":"Combinatorial Optimization: Theory and Practice"},{"key":"10.1016\/S0377-2217(99)00043-0_BIB2","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/opre.43.1.58","article-title":"A decomposition algorithm for local access telecommunications network expansion planning","volume":"43","author":"Balakrishnan","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00043-0_BIB3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02071977","article-title":"Finding minimum cost directed trees with demands and capacities","volume":"33","author":"Bousba","year":"1991","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(99)00043-0_BIB4","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"},{"issue":"1","key":"10.1016\/S0377-2217(99)00043-0_BIB5","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322358.322367","article-title":"Formulations and algorithms for the capacitated minimal directed tree problem","volume":"30","author":"Gavish","year":"1983","journal-title":"JACM"},{"key":"10.1016\/S0377-2217(99)00043-0_BIB6","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1109\/TCOM.1985.1096250","article-title":"Augmented lagrangean based algorithms for centralized network design","volume":"33","author":"Gavish","year":"1985","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0377-2217(99)00043-0_BIB7","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(99)00043-0_BIB8","unstructured":"Gouveia, L., Hall, L., 1998. A Comparative Study of Network Flow Formulations for the Capacitated Minimum Spanning Tree Problem, in preparation"},{"key":"10.1016\/S0377-2217(99)00043-0_BIB9","unstructured":"Gouveia, L., Martins, P., 1996. The capacitated minimum spanning tree problem: An experiment with a hop-indexed model, Annals of Operations Research, to appear"},{"key":"10.1016\/S0377-2217(99)00043-0_BIB10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/ijoc.8.3.219","article-title":"Experience with a cutting plane approach for the capacitated spanning tree problem","volume":"8","author":"Hall","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00043-0_BIB11","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/S0927-0507(05)80126-4","article-title":"Optimal trees in network models","volume":"7","author":"Magnanti","year":"1995","journal-title":"Handbooks in Operations Research and Management Science"},{"key":"10.1016\/S0377-2217(99)00043-0_BIB12","unstructured":"Martello, S., Toth, P., 1990. Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York"},{"key":"10.1016\/S0377-2217(99)00043-0_BIB13","unstructured":"Rardin, R., Choe, U., 1979. Tighter Relaxations of Fixed Charge Network Flow Problems, Report 3-79-18, Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799000430?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799000430?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T13:22:15Z","timestamp":1556112135000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799000430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0377221799000430"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00043-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}