An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem |
scientific article; zbMATH DE number 6816155
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem |
scientific article; zbMATH DE number 6816155 |
Statements
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (English)
0 references
6 December 2017
0 references
combinatorial optimization
0 references
maximal knapsack packing
0 references
minimal knapsack cover
0 references
dynamic programming
0 references
integer programming
0 references
0 references
0 references
0.91445315
0 references
0.9090845
0 references
0.90392977
0 references
0.8975415
0 references
0.8965359
0 references
0.89366865
0 references
0.8912128
0 references
0.88530976
0 references
