{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:27:15Z","timestamp":1730298435192,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/ssci.2017.8280805","type":"proceedings-article","created":{"date-parts":[[2018,2,7]],"date-time":"2018-02-07T21:44:37Z","timestamp":1518039877000},"page":"1-9","source":"Crossref","is-referenced-by-count":5,"title":["Solving the sequential ordering problem using branch and bound"],"prefix":"10.1109","author":[{"given":"J.","family":"Jamal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Shobaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Papapanagiotou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.M.","family":"Gambardella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Montemanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.04.008"},{"key":"ref11","first-page":"452","article-title":"A branch and bound algorithm for the sequential ordering problem","author":"karan","year":"2011","journal-title":"MIPRO 2011 Proceedings of the 34th International Convention"},{"key":"ref12","first-page":"2","article-title":"A decomposition-based exact approach for the sequential ordering problem","volume":"5","author":"montemanni","year":"2013","journal-title":"Journal of Applied Operational Research"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2004.27"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2512432"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SPC.2015.7473562"},{"journal-title":"Commonality and genetic algorithms","year":"1996","author":"chen","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00227-2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.12.3.237.12636"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SIS.2007.368027"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"journal-title":"Introduction to Algorithms","year":"2014","author":"cormen","key":"ref4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.4.699"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9725-9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02085641"},{"journal-title":"Solving the Sequential Ordering Problem using Branch and Bound - Online Compendium","year":"0","author":"jamal","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(88)90333-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585767"},{"journal-title":"Automatically Generated Lower Bounds for Search","year":"2004","author":"hernadvolgyi","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/inte.22.3.100"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008779125567"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0803002"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.05.003"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.10.014"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.10.014"},{"journal-title":"The Dynamic Hungarian Algorithm for the Assignment Problem With Changing Costs","year":"2007","author":"mills-tettey","key":"ref24"},{"journal-title":"Matheuristic techniques for the sequential ordering problem","year":"2011","author":"mojana","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.21236\/ADA237878"},{"journal-title":"TSPLIB A Library of Sample Instances for the TSP (and Related Problems) from Various Sources and of Various Types","year":"2014","author":"reinhelt","key":"ref25"}],"event":{"name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","start":{"date-parts":[[2017,11,27]]},"location":"Honolulu, HI","end":{"date-parts":[[2017,12,1]]}},"container-title":["2017 IEEE Symposium Series on Computational Intelligence (SSCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8267146\/8280782\/08280805.pdf?arnumber=8280805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T16:01:56Z","timestamp":1521216116000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8280805\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/ssci.2017.8280805","relation":{},"subject":[],"published":{"date-parts":[[2017,11]]}}}