Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (Q1762021)
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: Shift-and-merge technique for the DP solution of the time-constrained backpacker problem |
scientific article; zbMATH DE number 6107498
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shift-and-merge technique for the DP solution of the time-constrained backpacker problem |
scientific article; zbMATH DE number 6107498 |
Statements
Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (English)
0 references
15 November 2012
0 references
two-dimensional \(0\)-\(1\) knapsack problem
0 references
dynamic programming
0 references
combinatorial optimization
0 references
0 references
0 references
