[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/cejcs/KolpakovP21>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Mikhail_Posypkin>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Roman_Kolpakov>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1515%2Fcomp-2020-0212>
foaf:homepage <https://doi.org/10.1515/comp-2020-0212>
dc:identifier DBLP journals/cejcs/KolpakovP21 (xsd:string)
dc:identifier DOI doi.org%2F10.1515%2Fcomp-2020-0212 (xsd:string)
dcterms:issued 2021 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/cejcs>
rdfs:label Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Mikhail_Posypkin>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Roman_Kolpakov>
swrc:number 1 (xsd:string)
swrc:pages 116-126 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/cejcs/KolpakovP21/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/cejcs/KolpakovP21>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/cejcs/cejcs11.html#KolpakovP21>
rdfs:seeAlso <https://doi.org/10.1515/comp-2020-0212>
dc:title Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 11 (xsd:string)