{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:19:35Z","timestamp":1725470375040},"reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540325376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-32539-5_6","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T10:54:52Z","timestamp":1157972092000},"page":"37-42","source":"Crossref","is-referenced-by-count":6,"title":["Customer Selection and Profit Maximization in Vehicle Routing Problems"],"prefix":"10.1007","author":[{"given":"Deniz","family":"Aksen","sequence":"first","affiliation":[]},{"given":"Necati","family":"Aras","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0305-0548(94)90065-5","volume":"21","author":"S.E. Butt","year":"1994","unstructured":"Butt SE and Cavalier T (1994) A heuristic for the multiple tour maximum collection problem. Computers & Operations Research 21: 101\u2013111.","journal-title":"Computers & Operations Research"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/S0305-0548(98)00071-9","volume":"26","author":"S.E. Butt","year":"1999","unstructured":"Butt SE and Ryan DM (1999) An optimal solution procedure for the multiple tour maximum collection problem using column generation. Computers & Operations Research 26: 427\u2013441.","journal-title":"Computers & Operations Research"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"I. Chao","year":"1996","unstructured":"Chao I, Golden B and Wasil E (1996) The team orienteering problem. European Journal of Operational Research 88: 464\u2013474.","journal-title":"European Journal of Operational Research"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12: 568\u2013581.","journal-title":"Operations Research"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","volume":"10","author":"M. Desrochers","year":"1991","unstructured":"Desrochers M and Laporte G (1991) Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operation Research Letters 10: 27\u201336.","journal-title":"Operation Research Letters"},{"key":"6_CR6","first-page":"188 205","volume":"39","author":"D. Feillet","year":"2005","unstructured":"Feillet D, Dejax P and Gendreau M (2005) Traveling salesman problems with profits. Transportation Science 39:188 205.","journal-title":"Transportation Science"},{"key":"6_CR7","volume-title":"M\u00e9thodes de r\u00e9solution exacte pour les probl\u00e8mes de tourn\u00e9es de v\u00e9hicules","author":"C. Gueguen","year":"1999","unstructured":"Gueguen C (1999) M\u00e9thodes de r\u00e9solution exacte pour les probl\u00e8mes de tourn\u00e9es de v\u00e9hicules. Ph.D. thesis, Laboratoire Productique Logistique, Ecole Centrale Paris."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/S0377-2217(03)00377-1","volume":"158","author":"Kara","year":"2004","unstructured":"Kara \u0130, Laporte G and Bekta T (2004) A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem. European Journal of Operational Research 158: 793\u2013795.","journal-title":"European Journal of Operational Research"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","volume":"32","author":"H. Tang","year":"2005","unstructured":"Tang H and Miller-Hooks E (2005) A tabu search heuristic for the team orienteering problem. Computers & Operations Research 32: 1379\u20131407.","journal-title":"Computers & Operations Research"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1057\/palgrave.jors.2601848","volume":"56","author":"C.D. Tarantilis","year":"2005","unstructured":"Tarantilis CD, Ioannou G, Kiranoudis CT and Prastacos GP (2005) Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm. Journal of the Operational Research Society 56: 588\u2013596.","journal-title":"Journal of the Operational Research Society"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-32539-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:57:38Z","timestamp":1619571458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-32539-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540325376"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-32539-5_6","relation":{},"subject":[]}}