Show simple item record

dc.contributor.authorChatti, Hatem
dc.contributor.authorMonnot, Jérôme
dc.contributor.authorGourvès, Laurent
dc.date.accessioned2010-04-09T15:05:29Z
dc.date.available2010-04-09T15:05:29Z
dc.date.issued2010
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/3912
dc.language.isoenen
dc.subjectMinimum label vehicle routing problemen
dc.subject.ddc511en
dc.titleOn a Labeled Vehicle Routing Problemen
dc.typeCommunication / Conférence
dc.description.abstractenIn this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V,E) containing a special vertex 0 called the depot and where the edges are colored (labeled), the minimum label k-vehicle routing problem consists in finding a k-vehicle routing E′, i.e. a collection of cycles of size at most k + 1 which all contain the depot 0, and such that every customer v ∈ V ∖ {0} is visited once, minimizing the number of colors used.en
dc.identifier.citationpages271-282en
dc.relation.ispartofseriestitleLecture Notes in Computer Science
dc.relation.ispartofseriesnumber5901
dc.relation.ispartoftitleSOFSEM 2010: Theory and Practice of Computer Scienceen
dc.relation.ispartofeditorVan Leeuwen, Jan
dc.relation.ispartofeditorMuscholl, Anca
dc.relation.ispartofeditorPeleg, David
dc.relation.ispartofeditorPokorny, Jaroslav
dc.relation.ispartofeditorRumpe, Bernhard
dc.relation.ispartofpublnameSpringeren
dc.relation.ispartofpublcityBerlinen
dc.relation.ispartofdate2010
dc.relation.ispartofurlhttp://dx.doi.org/10.1007/978-3-642-11266-9
dc.relation.isversionofdoihttp://dx.doi.org/10.1007/978-3-642-11266-9_23
dc.description.sponsorshipprivateouien
dc.subject.ddclabelPrincipes généraux des mathématiquesen
dc.relation.ispartofisbn978-3-642-11265-2en
dc.relation.conftitleSOFSEM 2010: 36th Conference on Current Trends in Theory and Practice of Computer Scienceen
dc.relation.confdate2010-01
dc.relation.confcitySpindleruv Mlynen
dc.relation.confcountryRépublique tchèqueen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record