{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T17:36:17Z","timestamp":1762018577207,"version":"build-2065373602"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/ieem44572.2019.8978898","type":"proceedings-article","created":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T21:27:12Z","timestamp":1580765232000},"page":"1384-1387","source":"Crossref","is-referenced-by-count":3,"title":["A New Mathematical Model for the Traveling Repairman Problem"],"prefix":"10.1109","author":[{"given":"L. M.","family":"Naeni","sequence":"first","affiliation":[{"name":"School of Built Environment, University of Technology Sydney,NSW,Australia,2007"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Salehipour","sequence":"additional","affiliation":[{"name":"School of Mathematical and Physical Science, University of Technology Sydney,NSW,Australia,2007"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-011-0153-0"},{"key":"ref3","article-title":"An efficient GRASP+ VND metaheuristic for the traveling repairman problem","author":"salehipour","year":"2008","journal-title":"Working paper University of Antwerpen"},{"key":"ref10","article-title":"New formulations for the traveling repairman problem","author":"ezzine","year":"0","journal-title":"Proceedings of the International Conference on Modeling and Simulation"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-010-2727-y"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.cor.2018.01.016","article-title":"A branch-and-price algorithm for the Minimum Latency Problem","volume":"93","author":"teobaldo","year":"2018","journal-title":"Computers & Operations Research"},{"key":"ref8","article-title":"A polyhedral approach to the delivery man problem","author":"van eijl","year":"1995","journal-title":"Department of Math and Computing Science University of Technology"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-014-5678-x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.6.1055"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.05.009"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/393890"}],"event":{"name":"2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","start":{"date-parts":[[2019,12,15]]},"location":"Macao, China","end":{"date-parts":[[2019,12,18]]}},"container-title":["2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8961317\/8978490\/08978898.pdf?arnumber=8978898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:23:56Z","timestamp":1755800636000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8978898\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/ieem44572.2019.8978898","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}