{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:31:10Z","timestamp":1743064270777,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319729251"},{"type":"electronic","value":"9783319729268"}],"license":[{"start":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T00:00:00Z","timestamp":1513814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-72926-8_36","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T17:42:36Z","timestamp":1513791756000},"page":"436-448","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["GRASP Heuristics for a Generalized Capacitated Ring Tree Problem"],"prefix":"10.1007","author":[{"given":"Gabriel","family":"Bay\u00e1","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Mauttone","sequence":"additional","affiliation":[]},{"given":"Franco","family":"Robledo","sequence":"additional","affiliation":[]},{"given":"Pablo","family":"Romero","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"issue":"6","key":"36_CR1","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1287\/opre.1070.0432","volume":"55","author":"R Baldacci","year":"2007","unstructured":"Baldacci, R., Dell\u2019Amico, M., Gonz\u00e1lez, J.J.S.: The capacitated m-ring-star problem. Oper. Res. 55(6), 1147\u20131162 (2007)","journal-title":"Oper. Res."},{"issue":"3","key":"36_CR2","doi-asserted-by":"publisher","first-page":"341","DOI":"10.2298\/YJOR151115015B","volume":"27","author":"G Bay\u00e1","year":"2017","unstructured":"Bay\u00e1, G., Mauttone, A., Robledo, F.: The capacitated m two node survivable star problem. Yugoslav J. Oper. Res. 27(3), 341\u2013366 (2017)","journal-title":"Yugoslav J. Oper. Res."},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Bay\u00e1, G., Mauttone, A., Robledo, F., Romero, P.: Capacitated m two-node survivable star problem. Electron. Notes Discrete Math. 52, 253\u2013260 (2016). INOC 2015 7th International Network Optimization Conference","DOI":"10.1016\/j.endm.2016.03.034"},{"key":"36_CR4","unstructured":"Bhandari, R.: Optimal physical diversity algorithms and survivable networks. In: Proceedings of Second IEEE Symposium on Computers and Communications, 1997, pp. 433\u2013441. IEEE (1997)"},{"issue":"3","key":"36_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"SE Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The steiner problem in graphs. Networks 1(3), 195\u2013207 (1971)","journal-title":"Networks"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-15585-2_10","volume-title":"Numerical Methods and Applications","author":"A Hill","year":"2015","unstructured":"Hill, A.: Multi-exchange neighborhoods for the capacitated ring tree problem. In: Dimov, I., Fidanova, S., Lirkov, I. (eds.) NMA 2014. LNCS, vol. 8962, pp. 85\u201394. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15585-2_10"},{"issue":"2","key":"36_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s13675-015-0035-x","volume":"4","author":"A Hill","year":"2016","unstructured":"Hill, A., Vo\u00df, S.: Optimal capacitated ring trees. EURO J. Comput. Optim. 4(2), 137\u2013166 (2016)","journal-title":"EURO J. Comput. Optim."},{"issue":"18","key":"36_CR8","doi-asserted-by":"publisher","first-page":"2728","DOI":"10.1016\/j.dam.2011.11.029","volume":"160","author":"EA Hoshino","year":"2012","unstructured":"Hoshino, E.A., de Souza, C.C.: A branch-and-cut-and-price approach for the capacitated m-ring-star problem. Discrete Appl. Math. 160(18), 2728\u20132741 (2012)","journal-title":"Discrete Appl. Math."},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"1","key":"36_CR10","doi-asserted-by":"publisher","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. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"issue":"3","key":"36_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/net.10114","volume":"43","author":"M Labb\u00e9","year":"2004","unstructured":"Labb\u00e9, M., Laporte, G., Mart\u00edn, I.R., Gonz\u00e1lez, J.J.S.: The ring star problem: polyhedral analysis and exact algorithm. Networks 43(3), 177\u2013189 (2004)","journal-title":"Networks"},{"issue":"2","key":"36_CR12","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The traveling salesman problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2), 231\u2013247 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20133","key":"36_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01585735","volume":"46","author":"C Monma","year":"1990","unstructured":"Monma, C., Munson, B.S., Pulleyblank, W.R.: Minimum-weight two-connected spanning networks. Math. Prog. 46(1\u20133), 153\u2013171 (1990)","journal-title":"Math. Prog."},{"issue":"2","key":"36_CR14","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1111\/itor.12362","volume":"25","author":"R Recoba","year":"2017","unstructured":"Recoba, R., Robledo, F., Romero, P., Viera, O.: Two-node-connected star problem. Int. Trans. Oper. Res. 25(2), 523\u2013543 (2017)","journal-title":"Int. Trans. Oper. Res."},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-1-4614-6940-7_11","volume-title":"Search Methodologies","author":"Mauricio G. C. Resende","year":"2013","unstructured":"Resende, M.G.C., Ribeiro, C.C.: GRASP: Greedy Randomized Adaptive Search Procedures. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, pp. 287\u2013312. Springer, New York (2014). https:\/\/doi.org\/10.1007\/978-1-4614-6940-7_11"},{"key":"36_CR16","unstructured":"Robledo, F.: GRASP heuristics for Wide Area Network design. Ph.D. thesis, INRIA\/IRISA, Universit\u00e9 de Rennes I, Rennes, France (2005)"},{"issue":"2","key":"36_CR17","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10489-013-0460-6","volume":"40","author":"Z Zhang","year":"2014","unstructured":"Zhang, Z., Qin, H., Lim, A.: A memetic algorithm for the capacitated m-ringstar problem. Appl. Intell. 40(2), 305\u2013321 (2014)","journal-title":"Appl. Intell."}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72926-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:17:07Z","timestamp":1710335827000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-72926-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,21]]},"ISBN":["9783319729251","9783319729268"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72926-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,21]]},"assertion":[{"value":"21 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Machine Learning, Optimization, and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Volterra","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.taosciences.it\/mod\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}