[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/mp/Conde04>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Eduardo_Conde>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2Fs10107-003-0474-7>
foaf:homepage <https://doi.org/10.1007/s10107-003-0474-7>
dc:identifier DBLP journals/mp/Conde04 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2Fs10107-003-0474-7 (xsd:string)
dcterms:issued 2004 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/mp>
rdfs:label An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Eduardo_Conde>
swrc:number 2 (xsd:string)
swrc:pages 345-353 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/mp/Conde04/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/mp/Conde04>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/mp/mp100.html#Conde04>
rdfs:seeAlso <https://doi.org/10.1007/s10107-003-0474-7>
dc:subject polynomial algorithm; complexity; robust optimization; knapsack problem (xsd:string)
dc:title An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 100 (xsd:string)