{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T05:33:41Z","timestamp":1761888821224,"version":"build-2065373602"},"reference-count":4,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s13675-016-0068-9","type":"journal-article","created":{"date-parts":[[2016,5,11]],"date-time":"2016-05-11T10:28:50Z","timestamp":1462962530000},"page":"123-124","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Editorial"],"prefix":"10.1016","volume":"4","author":[{"given":"Bernard","family":"Fortz","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Gouveia","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1007\/s13675-016-0068-9_CR1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s13675-015-0043-x","article-title":"Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators","volume":"4","author":"de Sousa","year":"2016","journal-title":"EURO J Comput Optim"},{"issue":"2","key":"10.1007\/s13675-016-0068-9_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s13675-015-0059-2","article-title":"Models for video-on-demand scheduling with costs","volume":"4","author":"Gr\u00e9goire","year":"2016","journal-title":"EURO J Comput Optim"},{"key":"10.1007\/s13675-016-0068-9_CR3","doi-asserted-by":"crossref","unstructured":"Hill A, Vo\u00df (2016) Optimal capacitated ring trees. EURO J Comput Optim 4(2):137\u2013166","DOI":"10.1007\/s13675-015-0035-x"},{"issue":"2","key":"10.1007\/s13675-016-0068-9_CR4","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s13675-015-0042-y","article-title":"Generalized minimum spanning tree games","volume":"4","author":"Le","year":"2016","journal-title":"EURO J Comput Optim"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-016-0068-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-016-0068-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000575?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000575?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-016-0068-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:46:02Z","timestamp":1761882362000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["S2192440621000575"],"URL":"https:\/\/doi.org\/10.1007\/s13675-016-0068-9","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2016,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Editorial","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-016-0068-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2016 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}