{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:44Z","timestamp":1759847804583,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642206610"},{"type":"electronic","value":"9783642206627"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20662-7_10","type":"book-chapter","created":{"date-parts":[[2011,4,20]],"date-time":"2011-04-20T06:05:25Z","timestamp":1303279525000},"page":"112-123","source":"Crossref","is-referenced-by-count":8,"title":["On Minimum Changeover Cost Arborescences"],"prefix":"10.1007","author":[{"given":"Giulia","family":"Galbiati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Gualandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Maffioli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0166-218X(00)00392-9","volume":"113","author":"H. Wirth","year":"2001","unstructured":"Wirth, H., Steffan, J.: Reload cost problems: minimum diameter spaning tree. Discrete Applied Mathematics\u00a0113, 73\u201385 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"3494","DOI":"10.1016\/j.dam.2008.02.013","volume":"156","author":"G. Galbiati","year":"2008","unstructured":"Galbiati, G.: The complexity of a minimum reload cost diameter problem. Discrete Applied Mathematics\u00a0156, 3494\u20133497 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR3","unstructured":"Gamvros, I., Gouveia, L., Raghavan, S.: Reload cost trees and network design. In: Proc. International Network Optimization Conference, paper n.117 (2007)"},{"key":"10_CR4","unstructured":"Amaldi, E., Galbiati, G., Maffioli, F.: On minimum reload cost. Networks (to appear)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-540-95891-8_55","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"L. Gourv\u00e8s","year":"2009","unstructured":"Gourv\u00e8s, L., Lyra, A., Martinhon, C., Monnot, J.: The minimum reload s-t path, trail and walk problems. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., T\u016fma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 621\u2013632. Springer, Heidelberg (2009)"},{"key":"10_CR6","first-page":"317","volume":"1","author":"V. Kann","year":"1994","unstructured":"Kann, V.: Polynomially bounded minimization problems that are hard to approximate. Nordic J. Comp.\u00a01, 317\u2013331 (1994)","journal-title":"Nordic J. Comp."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0020-0190(98)00170-7","volume":"68","author":"P. Jonsson","year":"1997","unstructured":"Jonsson, P.: Near-optimal nonapproximability results for some NPO PB-complete problems. Inform. Process. Lett.\u00a068, 249\u2013253 (1997)","journal-title":"Inform. Process. Lett."},{"key":"10_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71","author":"J. Edmonds","year":"1967","unstructured":"Edmonds, J.: Optimum branchings. J. Res. Nat. Bur. Stand. (B)\u00a071, 233\u2013240 (1967)","journal-title":"J. Res. Nat. Bur. Stand. (B)"},{"key":"10_CR10","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization: polyhedra and efficiency. Springer, Heidelberg (2003)"},{"issue":"4","key":"10_CR11","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"E. Lawler","year":"1963","unstructured":"Lawler, E.: The quadratic assignment problem. Manag. Sci.\u00a09(4), 586\u2013599 (1963)","journal-title":"Manag. Sci."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"1494","DOI":"10.1016\/j.ejor.2006.09.028","volume":"187","author":"A. Caprara","year":"2008","unstructured":"Caprara, A.: Constrained 0\u20131 quadratic programming: Basic approaches and extensions. European Journal of Operational Research\u00a0187, 1494\u20131503 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"H. Gabow","year":"1986","unstructured":"Gabow, H., Galil, Z., Spencer, T., Tarjan, R.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica\u00a06(2), 109\u2013122 (1986)","journal-title":"Combinatorica"},{"issue":"1-2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s10107-010-0377-3","volume":"124","author":"C. Buchheim","year":"2010","unstructured":"Buchheim, C., Liers, F., Oswald, M.: Speeding up ip-based algorithms for constrained quadratic 0\u20131 optimization. Math. Progr. (B)\u00a0124(1-2), 513\u2013535 (2010)","journal-title":"Math. Progr. (B)"},{"key":"10_CR15","unstructured":"Hao, J., Orlin, J.: A faster algorithm for finding the minimum cut in a graph. In: Proc. of the 3rd ACM-SIAM Symposium on Discrete Algorithms, pp. 165\u2013174 (1992)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20662-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:20:28Z","timestamp":1558570828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20662-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642206610","9783642206627"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20662-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}