{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T08:57:57Z","timestamp":1781341077357,"version":"3.54.1"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1109\/coase.2014.6899457","type":"proceedings-article","created":{"date-parts":[[2014,11,11]],"date-time":"2014-11-11T19:28:58Z","timestamp":1415734138000},"page":"1063-1068","source":"Crossref","is-referenced-by-count":7,"title":["A column generation approach for the multi-vehicle covering tour problem"],"prefix":"10.1109","author":[{"given":"Keisuke","family":"Murakami","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.02.029"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2007.05.012"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.06.008"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.08.002"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.4.568"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.6.1086"},{"key":"ref16","first-page":"37","article-title":"Set Covering Algorithms Using Cutting Planes, Heuristics, and Subgradient Optimization: A Computational Study","volume":"12","author":"balas","year":"1980","journal-title":"Mathematical Programming"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1975.151"},{"key":"ref18","year":"0","journal-title":"ILOG CPLEX"},{"key":"ref4","first-page":"21","article-title":"Maximizing user convenience and postal service efficiency in post box location","volume":"26","author":"labbe","year":"1986","journal-title":"Belgian J Opns Res Stat Comput Sci"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1111\/0022-4146.00113"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(99)00006-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.23.3.208"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.22.2.340"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(88)90154-3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8_24"},{"key":"ref1","first-page":"55","article-title":"Scatter Searchmethods for the covering tour problem","volume":"30","author":"baldacci","year":"2005","journal-title":"In Metaheuristic Optimization Via Memory and Evolution Tabu Search and Scatter Search Operations Research\/Computer Science Interfaces Series"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(83)90033-6"}],"event":{"name":"2014 IEEE International Conference on Automation Science and Engineering (CASE)","location":"Taipei","start":{"date-parts":[[2014,8,18]]},"end":{"date-parts":[[2014,8,22]]}},"container-title":["2014 IEEE International Conference on Automation Science and Engineering (CASE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6892922\/6899294\/06899457.pdf?arnumber=6899457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T01:39:47Z","timestamp":1490319587000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6899457\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/coase.2014.6899457","relation":{},"subject":[],"published":{"date-parts":[[2014,8]]}}}