Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/cocoon/NipWX15
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/cocoon/NipWX15
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Kameng_Nip
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Wenxun_Xing
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Zhenbo_Wang
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-319-21398-9%5F8
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-319-21398-9_8
>
dc:
identifier
DBLP conf/cocoon/NipWX15
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-319-21398-9%5F8
(xsd:string)
dcterms:
issued
2015
(xsd:gYear)
rdfs:
label
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Kameng_Nip
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Wenxun_Xing
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Zhenbo_Wang
>
swrc:
pages
97-108
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/cocoon/2015
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/cocoon/NipWX15/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/cocoon/NipWX15
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/cocoon/cocoon2015.html#NipWX15
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-319-21398-9_8
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/cocoon
>
dc:
title
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document