{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T13:33:40Z","timestamp":1772890420756,"version":"3.50.1"},"reference-count":61,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":[[2003,7]]},"DOI":"10.1016\/s0377-2217(02)00404-6","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T22:25:53Z","timestamp":1048631153000},"page":"1-13","source":"Crossref","is-referenced-by-count":82,"title":["Generalized network design problems"],"prefix":"10.1016","volume":"148","author":[{"given":"Corinne","family":"Feremans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martine","family":"Labb\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00404-6_BIB1","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB2","series-title":"Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00)","first-page":"15","article-title":"A combinatorial approach to protein docking with flexible side chains","author":"Althaus","year":"2000"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB3","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1080\/07408170008967430","article-title":"The block layout shortest loop problem","volume":"32","author":"Asef-Vaziri","year":"2000","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0167-6377(89)90029-1","article-title":"On the spanning tree polyhedron","volume":"8","author":"Chopra","year":"1989","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01582573","article-title":"The Steiner tree problem I: Formulations, compositions and extension of facets","volume":"64","author":"Chopra","year":"1994","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01582574","article-title":"The Steiner tree problem II: Properties and classes of facets","volume":"64","author":"Chopra","year":"1994","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB7","article-title":"Worst-case analysis of a new heuritic for the traveling salesman problem","volume":"vol. 388","author":"Christofides","year":"1976"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB8","series-title":"Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"Cook","year":"1998"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0020-0255(96)00084-9","article-title":"An efficient transformation of the generalized traveling salesman problem into traveling salesman problem on digraphs","volume":"102","author":"Dimitrijevi\u0107","year":"1997","journal-title":"Information Sciences"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB10","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1023\/A:1009881326671","article-title":"Generalized Steiner problems and other variants","volume":"4","author":"Dror","year":"2000","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB11","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/S0377-2217(99)00006-5","article-title":"Generalized spanning trees","volume":"120","author":"Dror","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB12","first-page":"273","article-title":"Vehicle routing with stochastic demands and restricted failures","volume":"37","author":"Dror","year":"1993","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB13","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1002\/net.3230170309","article-title":"Some generalizations of the Steiner tree in graphs","volume":"17","author":"Duin","year":"1987","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB14","unstructured":"U. Faigle, W. Kern, P.C. Pop, G. Still, The Generalized Minimum Spanning Tree Problem, Working Paper, Department of Operations Research and Mathematical Programming, University of Twente, http:\/\/www.math.utwente.nl\/dos\/ormp\/preprints.htm, 2000"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB15","doi-asserted-by":"crossref","unstructured":"C. Feremans, Generalized spanning trees and extensions, Ph.D. dissertation, Universit\u00e9 Libre de Bruxelles, 2001","DOI":"10.1016\/S0377-2217(00)00267-8"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB16","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0377-2217(00)00267-8","article-title":"On generalized minimum spanning trees","volume":"134","author":"Feremans","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/net.10009","article-title":"A comparative analysis of several formulations for the generalized minimum spanning tree problem","volume":"39","author":"Feremans","year":"2002","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB18","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230260206","article-title":"The symmetric generalized traveling salesman polytope","volume":"26","author":"Fischetti","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB19","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.45.3.378","article-title":"A branch-and-cut algorithm for the symmetric generalized traveling salesman problem","volume":"45","author":"Fischetti","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB20","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB21","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/jagm.2000.1096","article-title":"A polylogarithmic approximation algorithm for the group Steiner tree problem","volume":"37","author":"Garg","year":"2000","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB22","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s002360000042","article-title":"The class Steiner minimal tree problem: A lower bound and test problem generation","volume":"37","author":"Gillard","year":"2000","journal-title":"Acta Informatica"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB23","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230230104","article-title":"A catalog of Steiner tree formulations","volume":"23","author":"Goemans","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB24","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01582064","article-title":"The Steiner tree polytope and related polyhedra","volume":"63","author":"Goemans","year":"1994","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB25","unstructured":"E. Gorres. On the node weighted Steiner tree problem. Ph.D. dissertation, New York University, 1992"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB26","first-page":"617","article-title":"Design of survivable networks","volume":"vol. 7","author":"Gr\u00f6tschel","year":"1995"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB27","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1002\/1097-0037(200101)37:1<8::AID-NET2>3.0.CO;2-R","article-title":"An improved approximation scheme for the group Steiner problem","volume":"37","author":"Helvig","year":"2001","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB28","first-page":"43","article-title":"The record balancing problem: A dynamic programming solution of a generalized traveling salesman problem","volume":"B-2","author":"Henry-Labordere","year":"1969","journal-title":"RIRO"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB29","unstructured":"D. Huygens. Version G\u00e9n\u00e9ralis\u00e9e du Probl\u00e8me de Conception de R\u00e9seau 2-Ar\u00ea te-Connexe. M\u00e9moire de Licence en Sciences Math\u00e9matiques, Facult\u00e9 des Sciences, Universit\u00e9 Libre de Bruxelles, 2000"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB30","first-page":"109","article-title":"Bounds on the quality of approximate solutions to the group Steiner tree problem","volume":"vol. 484","author":"Ihler","year":"1991"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB31","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0166-218X(98)00090-0","article-title":"Class Steiner trees and VLSI-design","volume":"90","author":"Ihler","year":"1999","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB32","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1006\/jagm.1995.1029","article-title":"A nearly best-possible approximation algorithm for node-weighted Steiner trees","volume":"19","author":"Klein","year":"1995","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB33","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","article-title":"Solving the Steiner tree problems in graphs to optimality","volume":"32","author":"Koch","year":"1998","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB34","unstructured":"A.M.C.A. Koster. Frequency assignment models and algorithms, Ph.D. dissertation, Proefschrift Universiteit Maastricht, 1999"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB35","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0167-6377(98)00043-1","article-title":"The partial constraint satisfaction problem: Facets and lifting theorems","volume":"23","author":"Koster","year":"1998","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB36","first-page":"22","article-title":"Maximizing user convenience and postal service efficiency in post box location","volume":"26","author":"Labb\u00e9","year":"1986","journal-title":"Belgian Journal of Operations Research, Statistics and Computer Science"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB37","series-title":"Vehicle Routing: Methods and Studies","first-page":"163","article-title":"Location routing problems","author":"Laporte","year":"1988"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB38","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1057\/jors.1996.190","article-title":"Some applications of the generalized traveling salesman problem","volume":"47","author":"Laporte","year":"1996","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB39","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0191-2615(89)90029-5","article-title":"An algorithm for the design of mailbox collection routes in urban area","volume":"23B","author":"Laporte","year":"1989","journal-title":"Transportation Research"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB40","first-page":"61","article-title":"Generalized traveling salesman problem through n sets of nodes: An integer programming approach","volume":"21","author":"Laporte","year":"1983","journal-title":"INFOR"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB41","first-page":"114","article-title":"Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem","volume":"37","author":"Laporte","year":"1999","journal-title":"INFOR"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB42","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","year":"1985"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB43","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/net.3230260410","article-title":"The shortest path with at most l nodes in each of the series\/parallel clusters","volume":"26","author":"Li","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB44","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0020-0255(93)90133-7","article-title":"Transformation of the generalized traveling salesman into the standard traveling salesman problem","volume":"74","author":"Lien","year":"1993","journal-title":"Information Sciences"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB45","first-page":"503","article-title":"Optimal trees","volume":"vol. 7","author":"Magnanti","year":"1995"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB46","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01582572","article-title":"Two-edge connected spanning subgraphs and polyhedra","volume":"64","author":"Mahjoub","year":"1994","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB47","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1002\/net.3230260407","article-title":"On the generalized minimum spanning tree problem","volume":"26","author":"Myung","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB48","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1287\/opre.39.4.623","article-title":"A Lagrangian based approach for the asymmetric generalized traveling salesman problem","volume":"39","author":"Noon","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB49","first-page":"39","article-title":"An efficient transformation of the generalized travelling salesman problem","volume":"31","author":"Noon","year":"1993","journal-title":"INFOR"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB50","unstructured":"C.E. Noon, The generalized traveling salesman problem, Ph.D. dissertation, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, 1988"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB51","doi-asserted-by":"crossref","unstructured":"P.C. Pop, W. Kern, G.J. Still. An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size, Working Paper, Department of Operations Research and Mathematical Programming, University of Twente, http:\/\/www.math.utwente.nl\/dos\/ormp\/preprints.htm 2001","DOI":"10.1016\/S1571-0653(05)80085-X"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB52","first-page":"196","volume":"vol. 411","year":"1990"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB53","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0377-2217(97)00142-2","article-title":"An efficient composite heuristic for the symmetric generalized traveling salesman problem","volume":"108","author":"Renaud","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB54","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1287\/ijoc.8.2.134","article-title":"A fast composite heuristic for the symmetric traveling salesman problem","volume":"4","author":"Renaud","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB55","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0166-218X(99)00200-0","article-title":"A note on the generalized Steiner tree polytope","volume":"100","author":"Salazar Gonz\u00e1lez","year":"2000","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB56","first-page":"185","article-title":"Mathematical model of scheduling clients through welfare agencies","volume":"8","author":"Saskena","year":"1970","journal-title":"Journal of the Canadian Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB57","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230170102","article-title":"The node-weighted Steiner tree problem","volume":"17","author":"Segev","year":"1987","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB58","unstructured":"P. Slav\u0131\u0301k. On the approximation of the generalized traveling salesman problem, Working Paper, Department of Mathematics, University of Buffalo, 1997"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB59","unstructured":"L. Snyder, M.S. Daskin. A random-key genetic algorithm for the generalized traveling salesman problem, Working Paper, Department of Industrial Engineering and Management Sciences, Northwestern University, http:\/\/users.iems.nwu.edu\/lsnyder\/papers\/gtsp.html, 2000"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB60","first-page":"97","article-title":"Generalized traveling salesman problem through n sets of nodes","volume":"7","author":"Srivastava","year":"1969","journal-title":"Journal of the Canadian Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00404-6_BIB61","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"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004046?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004046?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:29:57Z","timestamp":1553945397000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702004046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0377221702004046"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00404-6","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}