{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:14:32Z","timestamp":1773656072292,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"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,2]]},"DOI":"10.1016\/s0377-2217(99)00006-5","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"583-592","source":"Crossref","is-referenced-by-count":51,"title":["Generalized spanning trees"],"prefix":"10.1016","volume":"120","author":[{"given":"M.","family":"Dror","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Haouari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Chaouachi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00006-5_BIB1","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B., 1993. Network Flows, Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River, NJ"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB2","first-page":"266","article-title":"Directed Steiner tree problem on graph: Models, relaxations, and algorithms","volume":"28","author":"Dror","year":"1990","journal-title":"INFOR"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB3","unstructured":"Francis, R.L., McGinnis, L.F., White, J.A., 1992. Facility Layout and Location: An Analytic Approach. Prentice-Hall, Englewood Cliffs, NJ"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB4","unstructured":"Garey, M.R., Johnson, D.S., 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA"},{"key":"10.1016\/S0377-2217(99)00006-5_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":"J. ACM"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB6","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1109\/TCOM.1985.1096250","article-title":"Augmented Lagrangian based algorithms for centralized network design","volume":"33","author":"Gavish","year":"1985","journal-title":"IEEE Transactions Communications"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01580607","article-title":"Survivable networks, linear programming relaxations and the parsimonious property","volume":"60","author":"Goemans","year":"1993","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB8","unstructured":"Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison\u2013Wesley, Reading, MA"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB9","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling salesman problem and minimum spanning trees. Part II","volume":"1","author":"Held","year":"1971","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB10","unstructured":"Holland, J.H., 1975. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, MI"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB11","unstructured":"Hu, T.C., Kuh, E.S. (Eds.), 1985. VLSI Layout: Theory and Design. IEEE Press, New York, NY"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB12","unstructured":"Hwang, F.W., Richards, D.C., Winter, P., 1992. The Steiner Tree Problem, Annals Of Discrete Mathematics vol. 53, North-Holland, Amsterdam"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB13","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/opre.38.3.456","article-title":"A strong cutting plane algorithm for production scheduling with changeover costs","volume":"38","author":"Magnanti","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB14","doi-asserted-by":"crossref","unstructured":"Magnanti, T.L., Wolsey, L.A., 1995. Optimal trees, In: Ball, M.O., et al. (Eds.), Handbooks in OR & MS, vol. 7, pp. 503\u2013615","DOI":"10.1016\/S0927-0507(05)80126-4"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB15","first-page":"221","article-title":"Efficient greedy heuristics for steiner tree problems using reoptimization and supermodularity","volume":"28","author":"Minoux","year":"1990","journal-title":"INFOR"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB16","first-page":"39","article-title":"An efficient transformation of the generalized traveling salesman problem","volume":"31","author":"Noon","year":"1993","journal-title":"INFOR"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB17","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0166-218X(92)90151-Y","article-title":"Heuristics for the steiner problem in graphs","volume":"37\/38","author":"Plesnik","year":"1992","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB18","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 System Technological Journal"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB19","unstructured":"Schwartz, M. 1977. Computer and Communications Network Design and Analysis. Prentice-Hall, Englewood Cliffs, NJ"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB20","first-page":"573","article-title":"An approximate solution for the steiner problem in graphs","volume":"24","author":"Takahashi","year":"1980","journal-title":"Mathematica Japonica"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB21","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0166-218X(92)90021-2","article-title":"Steiner's problem in graphs: heuristic methods","volume":"40","author":"Vo\u03b2","year":"1992","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB22","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","article-title":"Steiner problem in networks: A survey","volume":"17","author":"Winter","year":"1987","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00006-5_BIB23","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","article-title":"A dual ascent approach for Steiner tree problems on a directed graph","volume":"28","author":"Wong","year":"1984","journal-title":"Mathematical Programming"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799000065?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799000065?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T13:00:43Z","timestamp":1579006843000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799000065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0377221799000065"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00006-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}