A Branch and Bound algorithm for the minimax regret spanning arborescence.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jgo/Conde07
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jgo/Conde07
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Eduardo_Conde
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10898-006-9074-4
>
foaf:
homepage
<
https://doi.org/10.1007/s10898-006-9074-4
>
dc:
identifier
DBLP journals/jgo/Conde07
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10898-006-9074-4
(xsd:string)
dcterms:
issued
2007
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jgo
>
rdfs:
label
A Branch and Bound algorithm for the minimax regret spanning arborescence.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Eduardo_Conde
>
swrc:
number
3
(xsd:string)
swrc:
pages
467-480
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jgo/Conde07/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jgo/Conde07
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jgo/jgo37.html#Conde07
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10898-006-9074-4
>
dc:
title
A Branch and Bound algorithm for the minimax regret spanning arborescence.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
37
(xsd:string)