{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:38:25Z","timestamp":1743082705809,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031629112"},{"type":"electronic","value":"9783031629129"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-62912-9_35","type":"book-chapter","created":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:01:37Z","timestamp":1718550097000},"page":"371-376","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Variable Neighborhood Search Approach for\u00a0the\u00a0S-labeling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8376-6209","authenticated-orcid":false,"given":"Marcos","family":"Robles","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5258-5915","authenticated-orcid":false,"given":"Sergio","family":"Cavero","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6247-5269","authenticated-orcid":false,"given":"Eduardo G.","family":"Pardo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"issue":"2","key":"35_CR1","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/s10589-021-00334-y","volume":"81","author":"S Cavero","year":"2022","unstructured":"Cavero, S., Pardo, E.G., Duarte, A.: A general variable neighborhood search for the cyclic antibandwidth problem. Comput. Optim. Appl. 81(2), 657\u2013687 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"35_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. (CSUR) 34(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.dam.2017.07.036","volume":"246","author":"G Fertin","year":"2018","unstructured":"Fertin, G., Rusu, I., Vialette, S.: The S-labeling problem: an algorithmic tour. Discret. Appl. Math. 246, 49\u201361 (2018)","journal-title":"Discret. Appl. Math."},{"key":"35_CR4","volume-title":"Variable Neighborhood Search","author":"P Hansen","year":"2019","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., P\u00e9rez, J.A.M.: Variable Neighborhood Search. Springer, Cham (2019)"},{"issue":"3","key":"35_CR5","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"106224","DOI":"10.1016\/j.cor.2023.106224","volume":"155","author":"M Lozano","year":"2023","unstructured":"Lozano, M., Rodriguez-Tello, E.: Population-based iterated greedy algorithm for the S-labeling problem. Comput. Oper. Res. 155, 106224 (2023)","journal-title":"Comput. Oper. Res."},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.cor.2019.04.014","volume":"108","author":"M Sinnl","year":"2019","unstructured":"Sinnl, M.: Algorithmic expedients for the S-labeling problem. Comput. Oper. Res. 108, 201\u2013212 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"35_CR8","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1051\/ita:2006037","volume":"40","author":"S Vialette","year":"2006","unstructured":"Vialette, S.: Packing of (0, 1)-matrices. RAIRO-Theor. Inf. Appl. 40(4), 519\u2013535 (2006)","journal-title":"RAIRO-Theor. Inf. Appl."}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62912-9_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:12:23Z","timestamp":1718550743000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62912-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031629112","9783031629129"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62912-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lorient","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mic2024.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}