A MILP-based VND for the min-max regret Shortest Path Tree Problem with interval costs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/endm/CarvalhoNDV18
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/endm/CarvalhoNDV18
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Christophe_Duhamel
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Iago_A._Carvalho
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Luiz_Filipe_M._Vieira
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Thiago_F._Noronha
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.endm.2018.03.006
>
foaf:
homepage
<
https://doi.org/10.1016/j.endm.2018.03.006
>
dc:
identifier
DBLP journals/endm/CarvalhoNDV18
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.endm.2018.03.006
(xsd:string)
dcterms:
issued
2018
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/endm
>
rdfs:
label
A MILP-based VND for the min-max regret Shortest Path Tree Problem with interval costs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Christophe_Duhamel
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Iago_A._Carvalho
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Luiz_Filipe_M._Vieira
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Thiago_F._Noronha
>
swrc:
pages
39-46
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/endm/CarvalhoNDV18/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/endm/CarvalhoNDV18
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/endm/endm66.html#CarvalhoNDV18
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.endm.2018.03.006
>
dc:
title
A MILP-based VND for the min-max regret Shortest Path Tree Problem with interval costs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
66
(xsd:string)