{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:34:03Z","timestamp":1742992443626,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181608"},{"type":"electronic","value":"9783319181615"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18161-5_17","type":"book-chapter","created":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T08:51:26Z","timestamp":1430383886000},"page":"191-202","source":"Crossref","is-referenced-by-count":0,"title":["Solving Relaxation Orienteering Problem Using DCA-CUT"],"prefix":"10.1007","author":[{"given":"Anh Son","family":"Ta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoai An","family":"Le Thi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Trong Sy","family":"Ha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G. Laporte","year":"1990","unstructured":"Laporte, G., Martello, S.: The selective travelling salesman problem. Discrete Applied Mathematics\u00a026, 193\u2013207 (1990)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0305-0548(94)90065-5","volume":"21","author":"E.B. Steven","year":"1994","unstructured":"Steven, E.B., Tom, M.C.: A heuristic for the multiple tour maximum collection problem. Computers & Operations Research\u00a021(1), 101\u2013111 (1994)","journal-title":"Computers & Operations Research"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Arkin, E.M., Mitchell, J.S.B., Narasimhan, G.: Resource-constrained Geometric Network Optimization. In: Proceedings of the Fourteenth Annual Symposium on Computational Geometry, pp. 307\u2013316 (1998)","DOI":"10.1145\/276884.276919"},{"key":"17_CR4","first-page":"181","volume":"7","author":"B.L. Golden","year":"1984","unstructured":"Golden, B.L., Assad, A., Dahl, R.: Analysis of a large-scale vehicle routing problem with inventory component. Large Scale Systems\u00a07, 181\u2013190 (1984)","journal-title":"Large Scale Systems"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"B.L. Golden","year":"1987","unstructured":"Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Naval Research Logistics\u00a034, 307\u2013318 (1987)","journal-title":"Naval Research Logistics"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/0377-2217(89)90388-3","volume":"41","author":"P. Keller","year":"1989","unstructured":"Keller, P.: Algorithms to solve the orienteering problem: a comparison. European Journal of Operational of Research\u00a041, 224\u2013231 (1989)","journal-title":"European Journal of Operational of Research"},{"issue":"6","key":"17_CR7","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1057\/jors.1992.88","volume":"43","author":"M. Kantor","year":"1992","unstructured":"Kantor, M., Rosenwein, M.: The orienteering problem with time windows. Journal of Operational Research Society\u00a043(6), 629\u2013635 (1992)","journal-title":"Journal of Operational Research Society"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"V. Pieter","year":"2011","unstructured":"Pieter, V., Wouter, S., Dirk, V.O.: The orienteering problem: A survey. European Journal of Operational Research\u00a0209(1), 1\u201310 (2011)","journal-title":"European Journal of Operational Research"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E. Balas","year":"1989","unstructured":"Balas, E.: The prize collecting traveling salesman problem. Networks\u00a019, 621\u2013636 (1989)","journal-title":"Networks"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1080\/02331930108844555","volume":"50","author":"H.A. Le Thi","year":"2001","unstructured":"Le Thi, H.A., Pham Dinh, T.: A Continuous Approach for Globally Solving Linearly Constrained Quadratic Zero - One Programming Problems. Optimization\u00a050, 93\u2013120 (2001)","journal-title":"Optimization"},{"key":"17_CR11","unstructured":"Alexander, S.: Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization (1998)"},{"key":"17_CR12","unstructured":"Nguyen Quang, T.: Approches locales et globales bas\u00e9es sur la programmation DC et DCA pour des probl\u00e8mes combinatoires en variables mixtes 0-1: applications \u00e0 la planification op\u00e9rationnelle, These de doctorat dirig\u00e9e par Le Thi H.A Informatique Metz (2010)"},{"key":"17_CR13","unstructured":"Nguyen, V.V.: Methodes exactes bas\u00e9es sur la programmation DC et nouvelles coupes pour l\u2019optimisation en variables mixtes zero-un, These de doctorat dirig\u00e9e par Pham Dinh T. and Le Thi H.A, LMI, INSA Rouen (2006)"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T. Tsiligirides","year":"1984","unstructured":"Tsiligirides, T.: Heuristic Methods Applied to Orienteering. Journal of the Operational Research Society\u00a035, 797\u2013809 (1984)","journal-title":"Journal of the Operational Research Society"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/0377-2217(95)00035-6","volume":"88","author":"I. Chao","year":"1996","unstructured":"Chao, I., Golden, B., Wasil, E.: Theory and methodology: a fast and effective heuristic for the orienteering problem. European Journal of Operational Research\u00a088, 475\u2013489 (1996)","journal-title":"European Journal of Operational Research"},{"key":"17_CR16","unstructured":"Chao, I.: Algorithms and Solutions to Multi-level Vehicle Routing Problems. PhD thesis, University of Maryland at College Park (1993)"}],"container-title":["Advances in Intelligent Systems and Computing","Modelling, Computation and Optimization in Information Systems and Management Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18161-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T09:27:59Z","timestamp":1674206879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18161-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181608","9783319181615"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18161-5_17","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}