Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem (Q2282074): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:34, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem |
scientific article |
Statements
Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem (English)
0 references
6 January 2020
0 references
discounted \(\{0\text{-}1\}\) knapsack problem
0 references
exact algorithm
0 references
approximate algorithm
0 references
dynamic programming
0 references
particle swarm optimization
0 references
