A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jco/Sbihi07
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jco/Sbihi07
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Abdelkader_Sbihi
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10878-006-9035-3
>
foaf:
homepage
<
https://doi.org/10.1007/s10878-006-9035-3
>
dc:
identifier
DBLP journals/jco/Sbihi07
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10878-006-9035-3
(xsd:string)
dcterms:
issued
2007
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jco
>
rdfs:
label
A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Abdelkader_Sbihi
>
swrc:
number
4
(xsd:string)
swrc:
pages
337-351
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jco/Sbihi07/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jco/Sbihi07
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jco/jco13.html#Sbihi07
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10878-006-9035-3
>
dc:
subject
Combinatorial optimization; Branch and bound; Sequential algorithm; Knapsack
(xsd:string)
dc:
title
A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
13
(xsd:string)