The Very Offline k-Vehicle Routing Problem in Trees. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/sccc/Muslea97>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Ion_Muslea>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1109%2FSCCC.1997.637087>
foaf:homepage	<https://doi.org/10.1109/SCCC.1997.637087>
dc:identifier	DBLP conf/sccc/Muslea97 (xsd:string)
dc:identifier	DOI doi.org%2F10.1109%2FSCCC.1997.637087 (xsd:string)
dcterms:issued	1997 (xsd:gYear)
rdfs:label	The Very Offline k-Vehicle Routing Problem in Trees. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Ion_Muslea>
swrc:pages	155-163 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/sccc/1997>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/sccc/Muslea97/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/sccc/Muslea97>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/sccc/sccc1997.html#Muslea97>
rdfs:seeAlso	<https://doi.org/10.1109/SCCC.1997.637087>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/sccc>
dc:subject	computational complexity; very offline k-vehicle routing problem; trees; general vehicle routing problem; NP-complete variants; fast approximation algorithms; 2-vehicle routing problems (xsd:string)
dc:title	The Very Offline k-Vehicle Routing Problem in Trees. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document