{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T00:25:01Z","timestamp":1779323101404,"version":"3.51.4"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,2,4]],"date-time":"2017-02-04T00:00:00Z","timestamp":1486166400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"DGIIP of Universidad T\u00e9cnica Federico Santa Mar\u00eda","award":["USM 28.15.20"],"award-info":[{"award-number":["USM 28.15.20"]}]},{"name":"CONACYT"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10479-017-2408-4","type":"journal-article","created":{"date-parts":[[2017,2,4]],"date-time":"2017-02-04T18:49:31Z","timestamp":1486234171000},"page":"503-545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Formulations for the orienteering problem with additional constraints"],"prefix":"10.1007","volume":"258","author":[{"given":"Pamela J.","family":"Palomo-Mart\u00ednez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Ang\u00e9lica","family":"Salazar-Aguilar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00edctor M.","family":"Albornoz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,4]]},"reference":[{"key":"2408_CR1","unstructured":"Archetti, C., Speranza, M. G., & Vigo, D. (2013). Vehicle routing problems with profits. Technical report, Technical Report WPDEM2013\/3, University of Brescia."},{"key":"2408_CR2","doi-asserted-by":"crossref","unstructured":"Arkin, E. M., Mitchell, J. S., & Narasimhan, G. (1998). Resource-constrained geometric network optimization. In Proceedings of the fourteenth annual symposium on computational geometry (pp. 307\u2013316). ACM.","DOI":"10.1145\/276884.276919"},{"key":"2408_CR3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10288-006-0009-1","volume":"5","author":"S Boussier","year":"2007","unstructured":"Boussier, S., Feillet, D., & Gendreau, M. (2007). An exact algorithm for team orienteering problems. 4OR, 5, 211\u2013230.","journal-title":"4OR"},{"key":"2408_CR4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0305-0548(94)90065-5","volume":"21","author":"SE Butt","year":"1994","unstructured":"Butt, S. E., & Cavalier, T. M. (1994). A heuristic for the multiple tour maximum collection problem. Computers and Operations Research, 21, 101\u2013111.","journal-title":"Computers and Operations Research"},{"key":"2408_CR5","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"I Chao","year":"1996","unstructured":"Chao, I., Golden, B. L., & Wasil, E. A. (1996). The team orienteering problem. European Journal of Operational Research, 88, 464\u2013474.","journal-title":"European Journal of Operational Research"},{"key":"2408_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0605004","volume":"5","author":"A Claus","year":"1984","unstructured":"Claus, A. (1984). A new formulation for the travelling salesman problem. SIAM Journal on Algebraic Discrete Methods, 5, 21\u201325.","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"issue":"3","key":"2408_CR7","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1016\/j.ejor.2014.10.059","volume":"242","author":"LC Coelho","year":"2015","unstructured":"Coelho, L. C., & Laporte, G. (2015). Classification, models and exact algorithms for multi-compartment delivery problems. European Journal of Operational Research, 242(3), 854\u2013864.","journal-title":"European Journal of Operational Research"},{"key":"2408_CR8","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., & Johnson, S. (1954). Solution of a large-scale traveling-salesman problem. Journal of the Operations Research Society of America, 2, 393\u2013410.","journal-title":"Journal of the Operations Research Society of America"},{"issue":"1","key":"2408_CR9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","volume":"10","author":"M Desrochers","year":"1991","unstructured":"Desrochers, M., & Laporte, G. (1991). Improvements and extensions to the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints. Operations Research Letters, 10(1), 27\u201336.","journal-title":"Operations Research Letters"},{"issue":"1","key":"2408_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.ejor.2009.06.029","volume":"203","author":"G Erdo\u011fan","year":"2010","unstructured":"Erdo\u011fan, G., Cordeau, J. F., & Laporte, G. (2010). The attractive traveling salesman problem. European Journal of Operational Research, 203(1), 59\u201369.","journal-title":"European Journal of Operational Research"},{"key":"2408_CR11","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. (2005). Traveling salesman problems with profits. Transportation science, 39, 188\u2013205.","journal-title":"Transportation science"},{"key":"2408_CR12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","volume":"10","author":"M Fischetti","year":"1998","unstructured":"Fischetti, M., Salazar-Gonzalez, J. J., & Toth, P. (1998). Solving the orienteering problem through branch-and-cut. INFORMS Journal on Computing, 10, 133\u2013148.","journal-title":"INFORMS Journal on Computing"},{"key":"2408_CR13","unstructured":"Fischetti, M., & Toth, P. (1988). An additive approach for the optimal solution of the prize collecting traveling salesman problem. In B. L. Golden & A. A. Assad (Eds.), Vehicle Routing: Methods and Studies (Vol. 231, pp. 319\u2013343)."},{"key":"2408_CR14","doi-asserted-by":"crossref","unstructured":"Garcia, A., Arbelaitz, O., Vansteenwegen, P., Souffriau, W., & Linaza, M. (2010). Hybrid approach for the public transportation time dependent orienteering problem with time windows. In E. Corchado, M. G. Romay & A. M. Savio (Eds.), Hybrid artificial intelligence systems, lecture notes in computer science (Vol. 6077, pp. 151\u2013158). Berlin, Heidelberg: Springer.","DOI":"10.1007\/978-3-642-13803-4_19"},{"key":"2408_CR15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s10732-014-9242-5","volume":"20","author":"D Gavalas","year":"2014","unstructured":"Gavalas, D., Konstantopoulos, C., Mastakas, K., & Pantziou, G. (2014). A survey on algorithmic approaches for solving tourist trip design problems. Journal of Heuristics, 20, 291\u2013328.","journal-title":"Journal of Heuristics"},{"key":"2408_CR16","unstructured":"Gavish, B., & Graves, S.C. (1978). The travelling salesman problem and related problems. Working Paper GR-078-78."},{"key":"2408_CR17","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-Q","volume":"32","author":"M Gendreau","year":"1998","unstructured":"Gendreau, M., Laporte, G., & Semet, F. (1998). A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks, 32, 263\u2013273.","journal-title":"Networks"},{"issue":"1","key":"2408_CR18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.ejor.2015.06.073","volume":"248","author":"M Gendreau","year":"2016","unstructured":"Gendreau, M., Manerba, D., & Mansini, R. (2016). The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach. European Journal of Operational Research, 248(1), 59\u201371.","journal-title":"European Journal of Operational Research"},{"key":"2408_CR19","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"BL Golden","year":"1987","unstructured":"Golden, B. L., Levy, L., & Vohra, R. (1987). The orienteering problem. Naval Research Logistics, 34, 307\u2013318.","journal-title":"Naval Research Logistics"},{"key":"2408_CR20","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","volume":"255","author":"A Gunawan","year":"2016","unstructured":"Gunawan, A., Lau, H. C., & Vansteenwegen, P. (2016). Orienteering problem: A survey of recent variants, solution approaches and applications. European Journal of Operational Research, 255, 315\u2013332.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2408_CR21","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s11750-010-0144-x","volume":"18","author":"M Iori","year":"2010","unstructured":"Iori, M., & Martello, S. (2010). Routing problems with loading constraints. TOP, 18(1), 4\u201327.","journal-title":"TOP"},{"key":"2408_CR22","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1057\/jors.1992.88","volume":"43","author":"MG Kantor","year":"1992","unstructured":"Kantor, M. G., & Rosenwein, M. B. (1992). The orienteering problem with time windows. Journal of the Operational Research Society, 43, 629\u2013635.","journal-title":"Journal of the Operational Research Society"},{"key":"2408_CR23","doi-asserted-by":"crossref","first-page":"515","DOI":"10.15807\/jorsj.31.515","volume":"31","author":"S Kataoka","year":"1988","unstructured":"Kataoka, S., & Morito, S. (1988). An algorithm for single constraint maximum collection problem. Journal of the Operations Research Society of Japan, 31, 515\u2013530.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"2408_CR24","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G Laporte","year":"1990","unstructured":"Laporte, G., & Martello, S. (1990). The selective travelling salesman problem. Discrete Applied Mathematics, 26, 193\u2013207.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"2408_CR25","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/net.21588","volume":"65","author":"D Manerba","year":"2015","unstructured":"Manerba, D., & Mansini, R. (2015). A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints. Networks, 65(2), 139\u2013154.","journal-title":"Networks"},{"key":"2408_CR26","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. Journal of the ACM (JACM), 7, 326\u2013329.","journal-title":"Journal of the ACM (JACM)"},{"issue":"4","key":"2408_CR27","first-page":"287","volume":"34","author":"R Montemanni","year":"2009","unstructured":"Montemanni, R., & Gambardella, L. (2009). Ant colony system for team orienteering problem with time windows. Foundations of computing and decision sciences, 34(4), 287\u2013306.","journal-title":"Foundations of computing and decision sciences"},{"key":"2408_CR28","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.cor.2015.11.007","volume":"78","author":"PJ Palomo-Mart\u00ednez","year":"2017","unstructured":"Palomo-Mart\u00ednez, P. J., Salazar-Aguilar, M. A., Laporte, G., & Langevin, A. (2017). A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints. Computers and Operations Research, 78, 408\u2013419.","journal-title":"Computers and Operations Research"},{"key":"2408_CR29","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.cor.2013.07.026","volume":"41","author":"MA Salazar-Aguilar","year":"2014","unstructured":"Salazar-Aguilar, M. A., Langevin, A., & Laporte, G. (2014). The multi-district team orienteering problem. Computers and Operations Research, 41, 76\u201382.","journal-title":"Computers and Operations Research"},{"key":"2408_CR30","unstructured":"Smith, D. E. (2004). Choosing objectives in over-subscription planning. In Proceedings of the 14th international conference on automated planning and scheduling (ICAPS 2004) (Vol.\u00a04, pp. 393\u2013401)."},{"key":"2408_CR31","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","volume":"32","author":"H Tang","year":"2005","unstructured":"Tang, H., & Miller-Hooks, E. (2005). A tabu search heuristic for the team orienteering problem. Computers and Operations Research, 32, 1379\u20131407.","journal-title":"Computers and Operations Research"},{"key":"2408_CR32","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.cor.2009.05.012","volume":"37","author":"F Tricoire","year":"2010","unstructured":"Tricoire, F., Romauch, M., Doerner, K. F., & Hartl, R. F. (2010). Heuristics for the multi-period orienteering problem with multiple time windows. Computers and Operations Research, 37, 351\u2013367.","journal-title":"Computers and Operations Research"},{"key":"2408_CR33","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T Tsiligirides","year":"1984","unstructured":"Tsiligirides, T. (1984). Heuristic methods applied to orienteering. Journal of the Operational Research Society, 35, 797\u2013809.","journal-title":"Journal of the Operational Research Society"},{"key":"2408_CR34","unstructured":"Van Den\u00a0Briel, M., Sanchez, R., Do, M. B., & Kambhampati, S. (2004) Effective approaches for partial satisfaction (over-subscription) planning. In Proceedings of the nineteenth national conference on artificial intelligence (AAAI-04) (pp. 562\u2013569)."},{"key":"2408_CR35","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10288-008-0086-4","volume":"7","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen, P. (2009). Planning in tourism and public transportation. 4OR, 7, 293\u2013296.","journal-title":"4OR"},{"key":"2408_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., & Van Oudheusden, D. (2011). The orienteering problem: A survey. European Journal of Operational Research, 209, 1\u201310.","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"2408_CR37","doi-asserted-by":"crossref","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","volume":"36","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., & Van Oudheusden, D. (2009). Iterated local search for the team orienteering problem with time windows. Computers and Operations Research, 36(12), 3281\u20133290.","journal-title":"Computers and Operations Research"},{"key":"2408_CR38","doi-asserted-by":"crossref","first-page":"6540","DOI":"10.1016\/j.eswa.2010.11.085","volume":"38","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., & Van Oudheusden, D. (2011). The city trip planner: An expert system for tourists. Expert Systems with Applications, 38, 6540\u20136546.","journal-title":"Expert Systems with Applications"},{"key":"2408_CR39","unstructured":"Wong, R. T. (1980). Integer programming formulations of the traveling salesman problem. In Proceedings of the IEEE international conference on circuits and computers (pp. 149\u2013152)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2408-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2408-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2408-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T15:03:11Z","timestamp":1589727791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2408-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,4]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["2408"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2408-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,4]]}}}