Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/approx/HalmanLS08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/approx/HalmanLS08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Chung-Lun_Li
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/David_Simchi-Levi
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Nir_Halman
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-85363-3%5F8
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-540-85363-3_8
>
dc:
identifier
DBLP conf/approx/HalmanLS08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-540-85363-3%5F8
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
rdfs:
label
Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Chung-Lun_Li
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/David_Simchi-Levi
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Nir_Halman
>
swrc:
pages
91-103
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/approx/2008
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/approx/HalmanLS08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/approx/HalmanLS08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/approx/approx2008.html#HalmanLS08
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-540-85363-3_8
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/approx
>
dc:
subject
Project management; time-cost tradeoff; approximation algorithms
(xsd:string)
dc:
title
Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document