{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:40:55Z","timestamp":1729611655619,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1109\/rivf.2013.6719892","type":"proceedings-article","created":{"date-parts":[[2014,1,24]],"date-time":"2014-01-24T16:23:41Z","timestamp":1390580621000},"page":"192-197","source":"Crossref","is-referenced-by-count":0,"title":["A meta-heuristic algorithm combining between Tabu and Variable Neighborhood Search for the Minimum Latency Problem"],"prefix":"10.1109","author":[{"family":"Bang Ban Ha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Nghia Nguyen Duc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"0","key":"15"},{"year":"0","key":"16"},{"key":"13","first-page":"215","article-title":"The traveling salesman problem: A case study in local optimization","author":"johnson","year":"0","journal-title":"Local Search in Combinatorial Optimization"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.09.009"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-011-0153-0"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.03.044"},{"key":"3","first-page":"9","article-title":"Improved genetic algorithm for minimum latency problem","author":"ban","year":"2010","journal-title":"Proc SOICT"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301432"},{"key":"1","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1137\/07068151X","article-title":"A faster, better approximation algorithm for the minimum latency problem","volume":"37","author":"archer","year":"2007","journal-title":"J SIAM"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238179"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195125"},{"key":"4","first-page":"1","article-title":"An efficient exact algorithm for minimum latency problem","author":"ban","year":"2013","journal-title":"J PI"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2.1.4"},{"key":"8","first-page":"152","article-title":"An improved approximation ratio for the minimum latency problem","author":"goemans","year":"1996","journal-title":"Proc SIAM SODA"}],"event":{"name":"2013 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future (RIVF)","start":{"date-parts":[[2013,11,10]]},"location":"Hanoi, Vietnam","end":{"date-parts":[[2013,11,13]]}},"container-title":["The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6712195\/6719848\/06719892.pdf?arnumber=6719892","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T02:38:54Z","timestamp":1498099134000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6719892\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/rivf.2013.6719892","relation":{},"subject":[],"published":{"date-parts":[[2013,11]]}}}