A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/itor/CarvalhoNDVS23
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/itor/CarvalhoNDVS23
>
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
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Vin%E2%88%9A%E2%89%A0cius_Fernandes_dos_Santos
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1111%2Fitor.12947
>
foaf:
homepage
<
https://doi.org/10.1111/itor.12947
>
dc:
identifier
DBLP journals/itor/CarvalhoNDVS23
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1111%2Fitor.12947
(xsd:string)
dcterms:
issued
2023
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/itor
>
rdfs:
label
A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty.
(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
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Vin%E2%88%9A%E2%89%A0cius_Fernandes_dos_Santos
>
swrc:
number
2
(xsd:string)
swrc:
pages
1120-1143
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/itor/CarvalhoNDVS23/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/itor/CarvalhoNDVS23
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/itor/itor30.html#CarvalhoNDVS23
>
rdfs:
seeAlso
<
https://doi.org/10.1111/itor.12947
>
dc:
title
A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
30
(xsd:string)