{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:10:29Z","timestamp":1743001829581,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_681","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:07:27Z","timestamp":1219662447000},"page":"3902-3908","source":"Crossref","is-referenced-by-count":1,"title":["Time-Dependent Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Mohit","family":"Tawarmalani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos V.","family":"Sahinidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"681_CR1_681","volume-title":"Network flows","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows. Prentice-Hall, Englewood Cliffs, NJ"},{"key":"681_CR2_681","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0305-0548(92)90066-E","volume":"19","author":"N. Balakrishnan","year":"1992","unstructured":"Balakrishnan N, Lucena A, Wong RT (1992) Scheduling examinations to reduce second-order conflicts. Comput Oper Res 19:353\u2013361","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"681_CR3_681","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1287\/opre.28.4.1018","volume":"28","author":"K. Fox","year":"1980","unstructured":"Fox K, Gavish B, Graves S (1980) An N-constraint formulation of the (time-dependent) traveling salesman problem. Oper Res 28(4):1018\u20131021","journal-title":"Oper. Res."},{"key":"681_CR4_681","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0377-2217(93)E0238-S","volume":"83","author":"L. Gouveia","year":"1995","unstructured":"Gouveia L, Vo\u00df S (1995) A\u00a0classification of formulations for the (time-dependent) traveling salesman problem. Europ J Oper Res 83:69\u201382","journal-title":"Europ. J. Oper. Res."},{"key":"681_CR5_681","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"19","author":"E.L. Lawler","year":"1963","unstructured":"Lawler EL (1963) The quadratic assignment problem. Managem Sci 19:586\u2013599","journal-title":"Managem. Sci."},{"key":"681_CR6_681","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for traveling salesman problem. Oper Res 21:498\u2013516","journal-title":"Oper. Res."},{"key":"681_CR7_681","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1002\/net.3230200605","volume":"20","author":"A. Lucena","year":"1990","unstructured":"Lucena A (1990) Time-dependent traveling salesman problem - The deliveryman case. Networks 20:753\u2013763","journal-title":"Networks"},{"issue":"3","key":"681_CR8_681","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/opre.29.3.464","volume":"29","author":"T.L. Magnanti","year":"1981","unstructured":"Magnanti TL, Wong RT (May-June 1981) Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Oper\n\t    Res 29(3) 464\u2013484","journal-title":"Oper. Res."},{"issue":"3","key":"681_CR9_681","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1287\/trsc.26.3.185","volume":"26","author":"C. Malandraski","year":"1992","unstructured":"Malandraski C, Daskin MS (1992) Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms. Transport Sci 26(3):185\u2013200","journal-title":"Transport. Sci."},{"key":"681_CR10_681","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/opre.26.1.86","volume":"26","author":"J.C. Picard","year":"1978","unstructured":"Picard JC, Queyranne M (1978) The time-dependent traveling salesman problem and its applications to the tardiness problem in\n\t    one-machine scheduling. Oper Res 26:86\u2013110","journal-title":"Oper. Res."},{"issue":"2","key":"681_CR11_681","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0098-1354(91)87008-W","volume":"15","author":"N.V. Sahinidis","year":"1991","unstructured":"Sahinidis NV, Grossmann IE (1991) MINLP model for cyclic multiproduct scheduling on continuous parallel lines. Comput Chem Eng 15(2):85\u2013103","journal-title":"Computers Chem. Engin."},{"issue":"3","key":"681_CR12_681","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H.D. Sherali","year":"1990","unstructured":"Sherali HD, Adams WP (Aug. 1990) A\u00a0hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J Discret Math 3(3):411\u2013430","journal-title":"SIAM J. Discret Math."},{"key":"681_CR13_681","unstructured":"Tawarmalani M (1997) Multistage network optimization and decomposition algorithms. Techn Report Univ Illinois, Urbana-Champaign"},{"issue":"2","key":"681_CR14_681","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1287\/trsc.29.2.167","volume":"29","author":"R.J. Vander Wiel","year":"1995","unstructured":"Vander Wiel RJ, Sahinidis NV (1995) Heuristic bounds and test problem generation for the time-dependent traveling salesman problem. Transport Sci 29(2):167\u2013183","journal-title":"Transport. Sci."},{"issue":"6","key":"681_CR15_681","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1002\/(SICI)1520-6750(199609)43:6<797::AID-NAV2>3.0.CO;2-#","volume":"43","author":"R.J. Vander Wiel","year":"1996","unstructured":"Vander Wiel RJ, Sahinidis NV (1996) An exact solution approach for the time-dependent traveling salesman problem. Naval Res Logist 43(6):797\u2013820","journal-title":"Naval Res. Logist."}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:23:22Z","timestamp":1720693402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_681","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}