An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2019.02.011 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128413133 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2019.02.011 / rank | |||
Normal rank | |||
Latest revision as of 06:43, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
