{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:12:22Z","timestamp":1725541942576},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_23","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T14:04:58Z","timestamp":1260194698000},"page":"271-282","source":"Crossref","is-referenced-by-count":0,"title":["On a Labeled Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Hatem","family":"Chatti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Gourv\u00e8s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.dam.2004.07.003","volume":"146","author":"C. Bazgan","year":"2005","unstructured":"Bazgan, C., Hassin, R., Monnot, J.: Approximation Algorithms for Some Routing Problems. Discrete Applied Mathematics\u00a0146, 3\u201326 (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"23_CR2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.7151\/dmgt.1053","volume":"17","author":"H. Broersma","year":"1997","unstructured":"Broersma, H., Li, X.: Spanning Trees with Many or Few Colors in Edge-Colored Graphs. Discussiones Mathematicae Graph Theory\u00a017(2), 259\u2013269 (1997)","journal-title":"Discussiones Mathematicae Graph Theory"},{"issue":"5","key":"23_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(97)00127-0","volume":"63","author":"R.-S. Chang","year":"1997","unstructured":"Chang, R.-S., Leu, S.-J.: The Minimum Labeling Spanning Trees. Information Processing Letters\u00a063(5), 277\u2013282 (1997)","journal-title":"Information Processing Letters"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/978-3-540-92182-0_68","volume-title":"Algorithms and Computation","author":"B. Couetoux","year":"2008","unstructured":"Couetoux, B., Gourv\u00e8s, L., Monnot, J., Telelis, O.: On Labeled Traveling Salesman Problems. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 776\u2013787. Springer, Heidelberg (2008)"},{"key":"23_CR5","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, CA (1979)"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M. Haimovich","year":"1985","unstructured":"Haimovich, M., Rinnooy Kan, A.H.G.: Bounds and Heuristics for Capacitated Routing Problems. Mathematics of Operations Research\u00a010, 527\u2013542 (1985)","journal-title":"Mathematics of Operations Research"},{"key":"23_CR7","first-page":"47","volume-title":"Analysis of Heuristics for Vehicle Routing Problems","author":"M. Haimovich","year":"1988","unstructured":"Haimovich, M., Rinnooy Kan, A.H.G., Stougie, L.: Vehicle Routing Methods and Studies. In: Golden, A. (ed.) Analysis of Heuristics for Vehicle Routing Problems, pp. 47\u201361. Elsevier, Amsterdam (1988)"},{"issue":"4","key":"23_CR8","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10878-007-9044-x","volume":"14","author":"R. Hassin","year":"2007","unstructured":"Hassin, R., Monnot, J., Segev, D.: Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. J. of Combinatorial Optimization\u00a014(4), 437\u2013453 (2007)","journal-title":"J. of Combinatorial Optimization"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D.G., Hell, P.: On the Completeness of a Generalized Matching Problem. In: Proceedings of STOC 1978, pp. 240\u2013245 (1978)","DOI":"10.1145\/800133.804353"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ipl.2005.06.009","volume":"96","author":"J. Monnot","year":"2005","unstructured":"Monnot, J.: The Labeled Perfect Matching in Bipartite Graphs. Information Processing Letters\u00a096, 81\u201388 (2005)","journal-title":"Information Processing Letters"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.orl.2006.12.004","volume":"35","author":"J. Monnot","year":"2007","unstructured":"Monnot, J., Toulouse, S.: The Path Partition Problem and Related Problems in Bipartite Graphs. Operations Research Letters\u00a035, 677\u2013684 (2007)","journal-title":"Operations Research Letters"},{"key":"23_CR12","unstructured":"Van-Nes, R.: Design of Multimodal Transport Networks: A Hierarchical Approach. PhD Thesis. Delft University Press (2002)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T22:25:35Z","timestamp":1552256735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}