{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:14:33Z","timestamp":1773656073528,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1023\/a:1009881326671","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T23:53:29Z","timestamp":1040601209000},"page":"415-436","source":"Crossref","is-referenced-by-count":28,"title":["Generalized Steiner Problems and Other Variants"],"prefix":"10.1007","volume":"4","author":[{"given":"Moshe","family":"Dror","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Haouari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"276199_CR1","volume-title":"Network Flows, Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows, Theory, Algorithms, and Applications, Prentice Hall: Upper Saddle River, NJ, 1993."},{"key":"276199_CR2","first-page":"399","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"S. Arora","year":"1997","unstructured":"S. Arora and C. Lund, \u201cHardness of approximations,\u201d in Approximation Algorithms for NP-Hard Problems, D.S. Hochbaum (Ed.), PWS Publishing Company: Boston, MA, 1997, pp. 399\u2013446."},{"key":"276199_CR3","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/0022-0000(80)90046-X","volume":"21","author":"G. Ausiello","year":"1980","unstructured":"G. Ausiello, A. D'Atri, and M. Protasi, \u201cStructure preserving reductions among convex optimization problems,\u201d J. Comput. System Sci., vol. 21, pp. 136\u2013153, 1980.","journal-title":"J. Comput. System Sci."},{"key":"276199_CR4","unstructured":"N. Christofides, \u201cWorst-case analysis of a new heuristic for the traveling salesman problem,\u201d Management Science Research Report No. 388, Carnegie-Mellon University, 1976."},{"key":"276199_CR5","unstructured":"E.G. Coffman, Jr. and M. Dror, \u201cBin packing with subsets of a set,\u201d unpublished notes, 1992."},{"key":"276199_CR6","first-page":"49","volume-title":"Algorithm Design for Computer System Design","author":"E.G. Coffman Jr.","year":"1984","unstructured":"E.G. Coffman, Jr., M.R. Garey, and D.S. Johnson, \u201cApproximation algorithms for bin packing\u2014an updated survey,\u201d in Algorithm Design for Computer System Design, G. Ausiello, M. Lucartini, and P. Serafini (Eds.), Springer-Verlag: New York, 1984, pp. 49\u2013106."},{"key":"276199_CR7","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/S0377-2217(99)00006-5","volume":"120","author":"M. Dror","year":"2000","unstructured":"M. Dror, M. Haouari, and J. Chaouachi, \u201cGeneralized spanning trees,\u201d European J. of Operational Research, vol. 120, pp. 583\u2013592, 2000.","journal-title":"European J. of Operational Research"},{"key":"276199_CR8","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"J. Edmonds and E.L. Johnson, \u201cMatching, Euler tours and the Chinese postman,\u201d Mathematical Programming, vol. 5, pp. 88\u2013124, 1973.","journal-title":"Mathematical Programming"},{"key":"276199_CR9","first-page":"128","volume":"8","author":"L. Euler","year":"1736","unstructured":"L. Euler, \u201cSolutio Problematis ad Geometriam Situs Pertinentis,\u201d Comment. Acad. Sci. Imp. Petropolitanae, vol. 8, pp. 128\u2013140, 1736.","journal-title":"Comment. Acad. Sci. Imp. Petropolitanae"},{"key":"276199_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman: San Francisco, CA, 1979."},{"key":"276199_CR11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01580607","volume":"60","author":"M.X. Goemans","year":"1993","unstructured":"M.X. Goemans and D.J. Bertsimas, \u201cSurvivable networks, linear programming relaxations and the parsimonious property,\u201d Mathematical Programming, vol. 60, pp. 145\u2013166, 1993.","journal-title":"Mathematical Programming"},{"key":"276199_CR12","unstructured":"B.L. Golden and W.R. Stewart, \u201cEmpirical analysis of heuristics,\u201d in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G Rinnooy Kan, and D.B. Shmoys (Eds.), John Wiley & Sons, Ltd., 1985, pp. 207\u2013249."},{"key":"276199_CR13","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1002\/1520-6750(199410)41:6<833::AID-NAV3220410611>3.0.CO;2-Q","volume":"41","author":"O. Goldschmidt","year":"1994","unstructured":"O. Goldschmidt, D. Nehme, and G. Yu, \u201cNote: On the set-union knapsack problem,\u201d Naval Research Logisticsvol. 41, pp. 833\u2013842, 1994.","journal-title":"Naval Research Logistics"},{"key":"276199_CR14","first-page":"43","volume":"B-2","author":"A.L. Henry-Labordere","year":"1969","unstructured":"A.L. Henry-Labordere, \u201cThe record balancing problem: A dynamic programming solution of the generalized travelling salesman problem,\u201d RIRO, vol. B-2, pp. 43\u201349, 1969.","journal-title":"RIRO"},{"key":"276199_CR15","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1287\/opre.46.5.675","volume":"46","author":"M.S. Hillier","year":"1998","unstructured":"M.S. Hillier and M.L. Brandeau, \u201cOptimal component assignment and board grouping in printed circuit board manufacturing,\u201d Operations Research, vol. 46, pp. 675\u2013689, 1998.","journal-title":"Operations Research"},{"key":"276199_CR16","unstructured":"A.J. Hoffman and P. Wolfe, \u201cHistory,\u201d in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (Eds.), John Wiley & Sons Ltd., 1985, pp. 1\u201315."},{"key":"276199_CR17","unstructured":"D.S. Johnson and C.H. Papadimitriou, \u201cComputational complexity,\u201d in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (Eds.), John Wiley & Sons, Ltd., 1985, pp. 37\u201385."},{"key":"276199_CR18","first-page":"413","volume":"146","author":"T.P. Kirkman","year":"1856","unstructured":"T.P. Kirkman, \u201cOn the representation of polyhedra,\u201d Philos. Trans. Roy. Soc. London Ser. A, vol. 146, pp. 413\u2013418, 1856.","journal-title":"Philos. Trans. Roy. Soc. London Ser. A"},{"key":"276199_CR19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"H.W. Kuhn, \u201cThe hungarian method for the assignment problem,\u201d Naval Research Logistics Quarterly, vol. 2, pp. 83\u201397, 1955.","journal-title":"Naval Research Logistics Quarterly"},{"key":"276199_CR20","first-page":"273","volume":"1","author":"M.K. Kwan","year":"1962","unstructured":"M.K. Kwan, \u201cGraphic programming using odd or even points,\u201d Chinese Math., vol. 1, pp. 273\u2013277, 1962.","journal-title":"Chinese Math."},{"key":"276199_CR21","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Handbooks in OR & MS vol. 4: Logistics of Production and Inventory","author":"E.L. Lawler","year":"1993","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, \u201cSequencing and scheduling: Algorithms and complexity,\u201d in Handbooks in OR & MS vol. 4: Logistics of Production and Inventory, S.S. Graves, A.H.G. Rinnooy Kan, and P. Zipkin (Eds.), North-Holland: New York, 1993, pp. 445\u2013522."},{"key":"276199_CR22","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J.K. Lenstra","year":"1976","unstructured":"J.K. Lenstra and A.H.G. Rinnooy Kan, \u201cOn general routing problems,\u201d Networks, vol. 11, pp. 221\u2013227, 1976.","journal-title":"Networks"},{"key":"276199_CR23","first-page":"503","volume-title":"Handbooks in OR & MS","author":"T.L. Magnanti","year":"1995","unstructured":"T.L. Magnanti and L.A. Wolsey, \u201cOptimal trees,\u201d in Handbooks in OR & MSvol. 7, M.O. Ball et al. (Eds.), North-Holland: Amsterdam, 1995, pp. 503\u2013615."},{"key":"276199_CR24","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":"276199_CR25","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G.L. Nemhauser","year":"1978","unstructured":"G.L. Nemhauser, L.A. Wolsey, and M.L. Fisher, \u201cAn analysis of approximations for maximizing submodular set functions\u2014I,\u201d Mathematical Programming, vol. 14, pp. 265\u2013294, 1978.","journal-title":"Mathematical Programming"},{"key":"276199_CR26","first-page":"39","volume":"31","author":"C.E. Noon","year":"1993","unstructured":"C.E. Noon and J.C. Bean, \u201cAn efficient transformation of the generalized traveling salesman problem,\u201d INFOR, vol. 31, pp. 39\u201344, 1993.","journal-title":"INFOR"},{"key":"276199_CR27","first-page":"185","volume":"8","author":"J.P. Saksena","year":"1970","unstructured":"J.P. Saksena, \u201cMathematical model of scheduling clients through welfare agencies,\u201d CORS J., vol. 8, pp. 185\u2013200, 1970.","journal-title":"CORS J."},{"key":"276199_CR28","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1287\/opre.36.5.778","volume":"36","author":"C.S. Tang","year":"1988","unstructured":"C.S. Tang and E.V. Denardo, \u201cModels arising from a flexible manufacturing machine. Part II: Minimizing the number of switching instances,\u201d Operations Research, vol. 36, pp. 778\u2013784, 1988.","journal-title":"Operations Research"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009881326671.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009881326671\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009881326671.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:15:15Z","timestamp":1751282115000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009881326671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["276199"],"URL":"https:\/\/doi.org\/10.1023\/a:1009881326671","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}