{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:15:37Z","timestamp":1763201737652},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,1,19]],"date-time":"2013-01-19T00:00:00Z","timestamp":1358553600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s10479-013-1308-5","type":"journal-article","created":{"date-parts":[[2013,1,18]],"date-time":"2013-01-18T06:19:37Z","timestamp":1358489977000},"page":"279-291","source":"Crossref","is-referenced-by-count":1,"title":["Fast approximation algorithms for routing problems with hop-wise constraints"],"prefix":"10.1007","volume":"222","author":[{"given":"Amir","family":"Elalouf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,19]]},"reference":[{"key":"1308_CR1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10479-007-0283-0","volume":"159","author":"C. Artigues","year":"2008","unstructured":"Artigues, C., & Feillet, D. (2008). A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research, 159, 135\u2013159.","journal-title":"Annals of Operations Research"},{"key":"1308_CR2","first-page":"372","volume":"16","author":"E. Camponogara","year":"2010","unstructured":"Camponogara, E., & Shima, R. B. (2010). Mobile agent routing with time constraints: a resource constrained longest-path approach. Journal of Universal Computer Science, 16, 372\u2013401.","journal-title":"Journal of Universal Computer Science"},{"key":"1308_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0186-0","volume":"154","author":"A. Chinchuluun","year":"2007","unstructured":"Chinchuluun, A., & Pardalos, P. (2007). A survey of recent developments in multiobjective optimization. Annals of Operations Research, 154, 29\u201350.","journal-title":"Annals of Operations Research"},{"key":"1308_CR4","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"2001","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to Algorithms. Cambridge: MIT Press."},{"key":"1308_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-24175-8_1","volume":"97","author":"A. Elalouf","year":"2011","unstructured":"Elalouf, A., Levner, E., & Cheng, T. C. E. (2011). Efficient routing of mobile agents for agent-based integrated enterprise management: a general acceleration technique. Lecture Notes in Business Information Processing, 97, 1\u201320.","journal-title":"Lecture Notes in Business Information Processing"},{"key":"1308_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/B:ANOR.0000019097.93634.07","volume":"128","author":"P. Eveborn","year":"2004","unstructured":"Eveborn, P., & Ronnqvist, M. (2004). Scheduler\u2014a system for staff planning. Annals of Operations Research, 128, 21\u201345.","journal-title":"Annals of Operations Research"},{"key":"1308_CR7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0020-0190(02)00205-3","volume":"83","author":"F. Ergun","year":"2002","unstructured":"Ergun, F., Sinha, R., & Zhang, L. (2002). An improved FPTAS for restricted shortest path. Information Processing Letters, 83, 287\u2013291.","journal-title":"Information Processing Letters"},{"key":"1308_CR8","doi-asserted-by":"crossref","first-page":"3081","DOI":"10.1016\/j.comnet.2010.05.017","volume":"54","author":"R. Garroppo","year":"2010","unstructured":"Garroppo, R., Giordano, S., & Tavanti, L. (2010). A survey on multi-constrained optimal path computation: exact and approximate algorithms. Computer Networks, 54, 3081\u20133107.","journal-title":"Computer Networks"},{"key":"1308_CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0166-218X(81)90008-1","volume":"3","author":"G. V. Gens","year":"1981","unstructured":"Gens, G. V., & Levner, E. V. (1981). Fast approximation algorithms for job sequencing with deadlines. Discrete Applied Mathematics, 3, 313\u2013318.","journal-title":"Discrete Applied Mathematics"},{"key":"1308_CR10","first-page":"854","volume-title":"IEEE Infocom\u20192001","author":"A. Goel","year":"2001","unstructured":"Goel, A., Ramakrishnan, K. G., Kataria, D., & Logothetis, D. (2001). Efficient computation of delay-sensitive routes from one source to all destinations. In IEEE Infocom\u20192001 (pp. 854\u2013858). New York: IEEE Press."},{"key":"1308_CR11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G. Y. Handler","year":"1980","unstructured":"Handler, G. Y., & Zang, I. (1980). A dual algorithm for the constrained shortest path problem. Networks, 10, 293\u2013310.","journal-title":"Networks"},{"key":"1308_CR12","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R. (1992). Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 17, 36\u201342.","journal-title":"Mathematics of Operations Research"},{"key":"1308_CR13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0377-2217(86)90092-5","volume":"25","author":"M. Henig","year":"1986","unstructured":"Henig, M. (1986). The shortest path problem with two objective functions. European Journal of Operational Research, 25, 281\u2013291.","journal-title":"European Journal of Operational Research"},{"key":"1308_CR14","first-page":"1854","volume":"17","author":"E. Levner","year":"2011","unstructured":"Levner, E., Elalouf, A., & Cheng, T. C. E. (2011). An improved FPTAS for mobile agent routing with time constraints. Journal of Universal Computer Science, 17, 1854\u20131862.","journal-title":"Journal of Universal Computer Science"},{"key":"1308_CR15","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"D. H. Lorenz","year":"2001","unstructured":"Lorenz, D. H., & Raz, D. (2001). A simple efficient approximation scheme for the restricted shortest path problem. Operations Research Letters, 28, 213\u2013219.","journal-title":"Operations Research Letters"},{"key":"1308_CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TNET.2006.890089","volume":"15","author":"G. Xue","year":"2007","unstructured":"Xue, G., Sen, A., Zhang, W., Tang, J., & Thulasiraman, K. (2007). Finding a path subject to many additive QoS constraints. IEEE Transactions on Networking, 15, 201\u2013211.","journal-title":"IEEE Transactions on Networking"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1308-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-013-1308-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1308-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:40Z","timestamp":1559138980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-013-1308-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,19]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["1308"],"URL":"https:\/\/doi.org\/10.1007\/s10479-013-1308-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,19]]}}}