{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:41:51Z","timestamp":1729618911338,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1109\/contel.2015.7231187","type":"proceedings-article","created":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T21:46:41Z","timestamp":1441316801000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["An adaptive large neighbourhood search for designing transparent optical core network"],"prefix":"10.1109","author":[{"given":"Deepak","family":"Mehta","sequence":"first","affiliation":[]},{"given":"Barry","family":"O'Sullivan","sequence":"additional","affiliation":[]},{"given":"Cemalettin","family":"Ozturk","sequence":"additional","affiliation":[]},{"given":"Luis","family":"Quesada","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1145\/301250.301447","article-title":"Designing networks with bounded pairwise distance","author":"dodis","year":"1999","journal-title":"Proc 21st Ann ACM Symp on Theory of Computing"},{"article-title":"Network Routing: Algorithms, Protocols, and Architectures (The Morgan Kaufmann Series in Networking)","year":"2010","author":"medhi","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"journal-title":"The DISCUS Project (FP7 Grant 318137) Tech Rep","article-title":"DISCUS, Deliverable 7.2, Preliminary quantitative results for flat optical network","year":"2014","key":"ref13"},{"journal-title":"The DISCUS Project (FP7 Grant 318137) Tech Rep","article-title":"DISCUS, Deliverable 2.1, Report on the initial DISCUS End to End Architecture","year":"2013","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2008.2006991"},{"article-title":"Constrained Shortest Paths and Related Problems - Constrained Network Optimization","year":"2007","author":"ziegelmann","key":"ref6"},{"key":"ref5","article-title":"FTTP deployment options and economic challenges","author":"payne","year":"2009","journal-title":"Proceedings of the 36th European Conference and Exhibition on Optical Communication (ECOC 2009)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5_13"},{"key":"ref7","article-title":"Network design problems with bounded distances via shallow-light steiner trees","volume":"abs 1409 6551","author":"chimani","year":"2014","journal-title":"CoRR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6736741"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-21527-8_1","article-title":"On the design of optical ofdm-based networks","volume":"6701","author":"benhamiche","year":"2011","journal-title":"Network Optimization ser Lecture Notes in Computer Science"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2014.90"}],"event":{"name":"2015 13th International Conference on Telecommunications (ConTEL)","start":{"date-parts":[[2015,7,13]]},"location":"Graz","end":{"date-parts":[[2015,7,15]]}},"container-title":["2015 13th International Conference on Telecommunications (ConTEL)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7209077\/7231179\/07231187.pdf?arnumber=7231187","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T18:40:31Z","timestamp":1691952031000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7231187\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/contel.2015.7231187","relation":{},"subject":[],"published":{"date-parts":[[2015,7]]}}}