An exact approach for the maximum concurrent k -splittable flow problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/ol/CaramiaS08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/ol/CaramiaS08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Antonino_Sgalambro
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Massimiliano_Caramia
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs11590-007-0055-4
>
foaf:
homepage
<
https://doi.org/10.1007/s11590-007-0055-4
>
dc:
identifier
DBLP journals/ol/CaramiaS08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs11590-007-0055-4
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/ol
>
rdfs:
label
An exact approach for the maximum concurrent k -splittable flow problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Antonino_Sgalambro
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Massimiliano_Caramia
>
swrc:
number
2
(xsd:string)
swrc:
pages
251-265
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/ol/CaramiaS08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/ol/CaramiaS08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/ol/ol2.html#CaramiaS08
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s11590-007-0055-4
>
dc:
subject
k-splittable flow; Branch and bound; Mixed integer programming; Multicommodity; Throughput
(xsd:string)
dc:
title
An exact approach for the maximum concurrent k -splittable flow problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
2
(xsd:string)