Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/eor/MacedoACCH11
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/eor/MacedoACCH11
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Cl%E2%88%9A%C2%B0udio_Alves
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Fran%E2%88%9A%C3%9Fois_Clautiaux
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jos%E2%88%9A%C2%A9_M._Val%E2%88%9A%C2%A9rio_de_Carvalho
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Rita_Macedo
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sa%E2%88%9A%C4%AEd_Hanafi
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.ejor.2011.04.037
>
foaf:
homepage
<
https://doi.org/10.1016/j.ejor.2011.04.037
>
dc:
identifier
DBLP journals/eor/MacedoACCH11
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.ejor.2011.04.037
(xsd:string)
dcterms:
issued
2011
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/eor
>
rdfs:
label
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Cl%E2%88%9A%C2%B0udio_Alves
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Fran%E2%88%9A%C3%9Fois_Clautiaux
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jos%E2%88%9A%C2%A9_M._Val%E2%88%9A%C2%A9rio_de_Carvalho
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Rita_Macedo
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sa%E2%88%9A%C4%AEd_Hanafi
>
swrc:
number
3
(xsd:string)
swrc:
pages
536-545
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/eor/MacedoACCH11/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/eor/MacedoACCH11
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/eor/eor214.html#MacedoACCH11
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.ejor.2011.04.037
>
dc:
title
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
214
(xsd:string)