A branch and cut algorithm for hub location problems with single assignment.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/mp/LabbeYG05
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/mp/LabbeYG05
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/%E2%88%9A%C4%8Cric_Gourdin
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hande_Yaman
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Martine_Labb%E2%88%9A%C2%A9
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10107-004-0531-x
>
foaf:
homepage
<
https://doi.org/10.1007/s10107-004-0531-x
>
dc:
identifier
DBLP journals/mp/LabbeYG05
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10107-004-0531-x
(xsd:string)
dcterms:
issued
2005
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/mp
>
rdfs:
label
A branch and cut algorithm for hub location problems with single assignment.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/%E2%88%9A%C4%8Cric_Gourdin
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hande_Yaman
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Martine_Labb%E2%88%9A%C2%A9
>
swrc:
number
2
(xsd:string)
swrc:
pages
371-405
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/mp/LabbeYG05/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/mp/LabbeYG05
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/mp/mp102.html#LabbeYG05
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10107-004-0531-x
>
dc:
subject
Hub location; Polyhedral analysis; Branch and cut
(xsd:string)
dc:
title
A branch and cut algorithm for hub location problems with single assignment.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
102
(xsd:string)