An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169)
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 empirical analysis of exact algorithms for the unbounded knapsack problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An empirical analysis of exact algorithms for the unbounded knapsack problem |
scientific article |
Statements
An empirical analysis of exact algorithms for the unbounded knapsack problem (English)
0 references
28 March 2019
0 references
combinatorial optimization
0 references
unbounded knapsack problem
0 references
dynamic programming
0 references
integer programming
0 references
branch and bound
0 references
0 references
0.8153554201126099
0 references
0.8151707053184509
0 references
0.8021857738494873
0 references
0.7908214330673218
0 references
