{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:12:02Z","timestamp":1725484322551},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439417"},{"type":"electronic","value":"9783540456223"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45622-8_4","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T14:45:20Z","timestamp":1179931520000},"page":"51-51","source":"Crossref","is-referenced-by-count":6,"title":["State Space Relaxation and Search Strategies in Dynamic Programming"],"prefix":"10.1007","author":[{"given":"Aristide","family":"Mingozzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,9]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: State-space relaxation procedures for the computation of bounds to routing problems. Networks 11 (1981)","DOI":"10.1002\/net.3230110207"},{"key":"4_CR2","volume-title":"PhD thesis","author":"R. Baldacci","year":"1999","unstructured":"Baldacci, R.: Algorithms for Location and Routing Problems in Distribution Systems. PhD thesis, Imperial College, London (1999)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Bodin, L., Mingozzi, A., Baldacci, R., Ball, M.: The rollon-rolloff vehicle routing problem. Transportation Science 34 (2000)","DOI":"10.1287\/trsc.34.3.271.12301"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Bianco, L., Mingozzi, A., Ricciardelli, S., Spadoni, M.: Exact and heuristic prodedures for the tsp with precedence constraints. Infor 32 (1994)","DOI":"10.1080\/03155986.1994.11732235"},{"key":"4_CR5","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the tsp with additional constraints. Technical Report IC, OR 80, Imperial College (1979)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Mingozzi, A., Bianco, L., Ricciardelli, S.: Dynamic programming strategies for the tsp with time windows and precedence constraints. Operations Research 45 (1997)","DOI":"10.1287\/opre.45.3.365"}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation, and Approximation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45622-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T03:31:20Z","timestamp":1556422280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45622-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439417","9783540456223"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-45622-8_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}