An Improved Unbounded-DP Algorithm for the Unbounded Knapsack Problem with Bounded Coefficients
Benchmark instances for the unbounded knapsack problem are typically generated according to specific criteria within a given constant range <i>R</i>, and these instances can be referred to as the unbounded knapsack problem with bounded coefficients (UKPB). In order to increase the difficulty of solv...
Αποθηκεύτηκε σε:
| Κύριος συγγραφέας: | |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
MDPI AG
2024-06-01
|
| Σειρά: | Mathematics |
| Θέματα: | |
| Διαθέσιμο Online: | https://www.mdpi.com/2227-7390/12/12/1878 |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|