Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls (Q2496024): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2004.09.016 / rank
Normal rank
 
Property / author
 
Property / author: Mohammad Kaykobad / rank
Normal rank
 
Property / author
 
Property / author: Mohammad Kaykobad / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2004.09.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006738678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for the multidimensional zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 knapsack problem with multiple choice constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trends in exact algorithms for the \(0-1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic tabu list management using the reverse elimination method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing approach to the multiconstraint zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2004.09.016 / rank
 
Normal rank

Latest revision as of 01:09, 19 December 2024

scientific article
Language Label Description Also known as
English
Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
scientific article

    Statements

    Identifiers