{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:08:24Z","timestamp":1725905304576},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319557014"},{"type":"electronic","value":"9783319557021"}],"license":[{"start":{"date-parts":[[2017,7,21]],"date-time":"2017-07-21T00:00:00Z","timestamp":1500595200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-55702-1_37","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T14:21:16Z","timestamp":1500560476000},"page":"277-283","source":"Crossref","is-referenced-by-count":3,"title":["A Periodic Traveling Politician Problem with Time-Dependent Rewards"],"prefix":"10.1007","author":[{"given":"Deniz","family":"Aksen","sequence":"first","affiliation":[]},{"given":"Masoud","family":"Shahmanzari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"key":"37_CR1","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press (2011)"},{"issue":"1","key":"37_CR2","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1002\/net.20307","volume":"54","author":"JF Brub","year":"2009","unstructured":"Brub, J.F., Gendreau, M., Potvin, J.Y.: A branch and cut algorithm for the undirected prize collecting traveling salesman problem. Networks 54(1), 56\u201367 (2009)","journal-title":"Networks"},{"key":"37_CR3","volume-title":"In Pursuit of the Salesman: Mathematics at the Limits of Computation","author":"W Cook","year":"2011","unstructured":"Cook, W.: In Pursuit of the Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton, USA (2011)"},{"issue":"2","key":"37_CR4","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transp. Sci. 39(2), 188\u2013205 (2005)","journal-title":"Transp. Sci."},{"issue":"1","key":"37_CR5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ejor.2012.01.030","volume":"220","author":"N Labadie","year":"2012","unstructured":"Labadie, N., Mansini, R., Melechovsk\u00fd, J., Calvo, R.W.: The team orienteering problem with time windows: an LP based granular variable neighborhood search. Eur. J. Oper. Res. 220(1), 15\u201327 (2012)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55702-1_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T14:30:15Z","timestamp":1500561015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55702-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,21]]},"ISBN":["9783319557014","9783319557021"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55702-1_37","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2017,7,21]]}}}