{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:52:24Z","timestamp":1725605544204},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215261"},{"type":"electronic","value":"9783642215278"}],"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-21527-8_6","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T11:01:16Z","timestamp":1315479676000},"page":"43-50","source":"Crossref","is-referenced-by-count":6,"title":["Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Salles da Cunha","sequence":"first","affiliation":[]},{"given":"Luidi","family":"Simonetti","sequence":"additional","affiliation":[]},{"given":"Abilio","family":"Lucena","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01582064","volume":"63","author":"M.X. Goemans","year":"1994","unstructured":"Goemans, M.X.: The Steiner Polytope and Related Polyhedra. Mathematical Programming\u00a063, 157\u2013182 (1994)","journal-title":"Mathematical Programming"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Huang, B., Liu, N.: Bi-level Programming Approach to Optimizing a Logistic Distribution Network with Balancing Requirements. Transportation Research Record (1894), 188\u2013197 (2004)","DOI":"10.3141\/1894-20"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J. Kruskal","year":"1956","unstructured":"Kruskal, J.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society\u00a07, 48\u201350 (1956)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"6_CR4","first-page":"503","volume-title":"Handbooks in OR and MS","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti, T.L., Wolsey, L.: Optimal Trees. In: Ball, O., et al. (eds.) Handbooks in OR and MS, vol.\u00a07, pp. 503\u2013615. North-Holland, Amsterdam (1995)"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.ejor.2009.07.038","volume":"203","author":"M. Mekking","year":"2010","unstructured":"Mekking, M., Volgenant, A.: Solving the 2-rooted mini-max spanning forest problem by branch-and-bound. European Journal of Operational Research\u00a0203(1), 50\u201358 (2010)","journal-title":"European Journal of Operational Research"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M.W. Padberg","year":"1991","unstructured":"Padberg, M.W., Rinaldi, G.: A Branch-and-Cut algorithm for resolution of large scale of Symmetric Traveling Salesman Problem. SIAM Review\u00a033, 60\u2013100 (1991)","journal-title":"SIAM Review"},{"key":"6_CR7","first-page":"511","volume":"17","author":"M.W. Padberg","year":"1983","unstructured":"Padberg, M.W., Wolsey, L.: Trees and cuts. Annals of Discrete Mathematics\u00a017, 511\u2013517 (1983)","journal-title":"Annals of Discrete Mathematics"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/0377-2217(94)00335-1","volume":"91","author":"T. Yamada","year":"1996","unstructured":"Yamada, T., Takahashi, H., Kataoka, S.: A heuristic algorithm for the mini-max spanning forest problem. European Journal of Operational Research\u00a091(3), 565\u2013572 (1996)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0377-2217(96)00155-5","volume":"101","author":"T. Yamada","year":"1997","unstructured":"Yamada, T., Takahashi, H., Kataoka, S.: A branch-and-bound algorithm for the mini-max spanning forest problem. European Journal of Operational Research\u00a0101(1), 93\u2013103 (1997)","journal-title":"European Journal of Operational Research"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Zhou, G., Min, H., Gen, M.: The balanced allocation of customers to multiple distribution centers in the supply chain network: A genetic algorithm approach. Computers and Industrial Engineering (43), 251\u2013261 (2002)","DOI":"10.1016\/S0360-8352(02)00067-0"}],"container-title":["Lecture Notes in Computer Science","Network Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21527-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T04:27:59Z","timestamp":1560572879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21527-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215261","9783642215278"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21527-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}