{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T17:56:33Z","timestamp":1772301393196,"version":"3.50.1"},"publisher-location":"Heidelberg","reference-count":7,"publisher":"Physica-Verlag HD","isbn-type":[{"value":"9783790806083","type":"print"},{"value":"9783642484179","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/978-3-642-48417-9_42","type":"book-chapter","created":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T03:29:16Z","timestamp":1338521356000},"page":"144-147","source":"Crossref","is-referenced-by-count":1,"title":["On the Multi-Depot Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"J. Orestes","family":"Cerdeira","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","series-title":"Memorandum \u2116693","volume-title":"Covering Nodes by k Node-Disjoint Trees with Additional Constraints","author":"SM Baas","year":"1988","unstructured":"S.M. Baas and J.O. Cerdeira, \u201cCovering Nodes by k Node-Disjoint Trees with Additional Constraints\u201d, Memorandum \u2116693, Faculteit der Toegepaste Wiskunde, Universiteit Twente, 1988."},{"key":"42_CR2","volume-title":"Cobertura dos Vertices de um Grafo por k Arvores e Ciclos Disjuntos nos Vertices","author":"JO Cerdeira","year":"1990","unstructured":"J.O. Cerdeira, \u201cCobertura dos Vertices de um Grafo por k Arvores e Ciclos Disjuntos nos Vertices\u201d, Tese de Doutoramento, Faculdade de Ci\u00eancias da Universidade de Lisboa, 1990."},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"R.W. Floyd, \u201cAlgorithm 97: Shortest Path\u201d, Communications of the ACM, 5, 1962, 345.","journal-title":"Communications of the ACM"},{"key":"42_CR4","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M Held","year":"1974","unstructured":"M. Held, P. Wolfe and H.P. Crowder, Validation of Subgradient Optimization, Mathematical Programming, 6, 1974, 62\u201388.","journal-title":"Mathematical Programming"},{"key":"42_CR5","first-page":"145","volume-title":"The Traveling Salesman Problem: A Guide Tour of Combinatorial Optimization","author":"DS Johnson","year":"1985","unstructured":"D.S. Johnson and C.H. Papadimitriou, \u201cPerformance Guarantees for Heuristics\u201d , in The Traveling Salesman Problem: A Guide Tour of Combinatorial Optimization, Eds.: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, John Wiley & Sons, New York, 1985, 145\u2013180."},{"key":"42_CR6","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"CH Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and K. Stieglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, New York, 1982."},{"key":"42_CR7","volume-title":"Discrete Optimization Algorithms with Pascal Programs","author":"MM Syslo","year":"1983","unstructured":"M.M. Syslo, N. Deo and J.S. Kowalik, Discrete Optimization Algorithms with Pascal Programs, Prentice-Hall, Englewood Cliffs, New York, 1983."}],"container-title":["Operations Research \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-48417-9_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T14:50:26Z","timestamp":1620139826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-48417-9_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783790806083","9783642484179"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-48417-9_42","relation":{},"subject":[],"published":{"date-parts":[[1992]]}}}