{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:19Z","timestamp":1740145159050,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2016,9,17]],"date-time":"2016-09-17T00:00:00Z","timestamp":1474070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No.11461081"],"award-info":[{"award-number":["No.11461081"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s11590-016-1078-5","type":"journal-article","created":{"date-parts":[[2016,9,17]],"date-time":"2016-09-17T08:17:22Z","timestamp":1474100242000},"page":"1663-1675","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length"],"prefix":"10.1007","volume":"11","author":[{"given":"Junran","family":"Lichen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ko-Wei","family":"Lih","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,17]]},"reference":[{"key":"1078_CR1","volume-title":"Programming, Games, and Transportation Networks","author":"C Berge","year":"1965","unstructured":"Berge, C., Ghouila-Houri, A.: Programming, Games, and Transportation Networks. John Wiley, New York (1965)"},{"key":"1078_CR2","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Management Sciences Research Report No.388, Carnegie-Mellon University, Pittsburgh (1976)"},{"issue":"3","key":"1078_CR3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N Christofides","year":"1981","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Programm. 20(3), 255\u2013282 (1981)","journal-title":"Math. Programm."},{"key":"1078_CR4","volume-title":"Approximation Algorithms for NP-Hard Problems, 46\u201393","author":"EG Coffman","year":"1996","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, 46\u201393. PWS Publishing, Boston (1996)"},{"key":"1078_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"4","key":"1078_CR6","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.5.4.426","volume":"5","author":"M Fischetti","year":"1993","unstructured":"Fischetti, M., Toth, P.: An efficient algorithm for the min-sum arborescence problem on complete digraphs. ORSA J. Comput. 5(4), 426\u2013434 (1993)","journal-title":"ORSA J. Comput."},{"issue":"4","key":"1078_CR7","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","volume":"42","author":"ML Fisher","year":"1994","unstructured":"Fisher, M.L.: Optimal solution of vehicle routing problems using minimum \n                        $$K$$\n                        \n                            \n                                            \n                                K\n                            \n                        \n                    -trees. Oper. Res. 42(4), 626\u2013642 (1994)","journal-title":"Oper. Res."},{"issue":"4","key":"1078_CR8","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1287\/opre.42.4.775","volume":"42","author":"ML Fisher","year":"1994","unstructured":"Fisher, M.L.: A polynomial algorithm for the degree-constrained minimum \n                        $$K$$\n                        \n                            \n                                            \n                                K\n                            \n                        \n                    -tree problem. Oper. Res. 42(4), 775\u2013779 (1994)","journal-title":"Oper. Res."},{"key":"1078_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"1078_CR10","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18, 1138\u20131162 (1970)","journal-title":"Oper. Res."},{"key":"1078_CR11","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M Held","year":"1971","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. II. Math. Program. 1, 6\u201325 (1971)","journal-title":"Math. Program."},{"key":"1078_CR12","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proce. Am. Math. Soc. 7, 48\u201350 (1956)","journal-title":"Proce. Am. Math. Soc."},{"issue":"6","key":"1078_CR13","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1007\/s11590-015-0935-y","volume":"10","author":"JP Li","year":"2016","unstructured":"Li, J.P., Guan, L., Ding, H.L., Li, W.D.: Approximations for constructing tree-form structures by specific material with fixed length. Optim. Lett. 10(6), 1337\u20131345 (2016). doi:\n                        10.1007\/s11590-015-0935-y","journal-title":"Optim. Lett."},{"key":"1078_CR14","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/S0377-2217(03)00353-9","volume":"158","author":"C Martinhon","year":"2004","unstructured":"Martinhon, C., Lucena, A., Maculan, N.: Stronger \n                        $$K$$\n                        \n                            \n                                            \n                                K\n                            \n                        \n                    -tree relaxations for the vehicle routing problem. Eur. J. Oper. Res. 158, 56\u201371 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"1078_CR15","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"1078_CR16","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563\u2013581 (1977)","journal-title":"SIAM J. Comput."},{"key":"1078_CR17","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, The Netherlands (2003)"},{"key":"1078_CR18","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Res. Logist. 41, 579\u2013585 (1994)","journal-title":"Naval Res. Logist."},{"key":"1078_CR19","volume-title":"Minimum Spanning Trees, in Chapter 6, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics","author":"RE Tarjan","year":"1983","unstructured":"Tarjan, R.E.: Minimum Spanning Trees, in Chapter 6, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics. SIAM, Philadelphia, PA (1983)"},{"key":"1078_CR20","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer-Verlag, Berlin (2001)"},{"key":"1078_CR21","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/j.orl.2005.04.010","volume":"34","author":"A Westerlund","year":"2006","unstructured":"Westerlund, A., Gothe-Lundgren, M., Larsson, T.: A note on relatives to the Held and Karp 1-tree problem. Oper. Res. Lett. 34, 275\u2013282 (2006)","journal-title":"Oper. Res. Lett."},{"issue":"15","key":"1078_CR22","doi-asserted-by":"crossref","first-page":"2212","DOI":"10.1016\/j.dam.2005.04.012","volume":"154","author":"A Westerlund","year":"2006","unstructured":"Westerlund, A., Gothe-Lundgren, M., Larsson, T.: A stabilized column generation scheme for the traveling salesman subtour problem. Discret. Appl. Math. 154(15), 2212\u20132238 (2006)","journal-title":"Discret. Appl. Math."},{"key":"1078_CR23","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/BF01609023","volume":"15","author":"Y Yamamoto","year":"1978","unstructured":"Yamamoto, Y.: The Held-Karp algorithm and degree-constrained minimum \n                        $$1$$\n                        \n                            \n                                            \n                                \n                                    1\n                                \n                            \n                        \n                    -trees. Math. Program. 15, 228\u2013231 (1978)","journal-title":"Math. Program."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1078-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1078-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1078-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,10]],"date-time":"2017-11-10T01:31:17Z","timestamp":1510277477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1078-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,17]]},"references-count":23,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["1078"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1078-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2016,9,17]]}}}