Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
From MaRDI portal
Publication:1762021
DOI10.1016/j.cor.2011.05.017zbMath1251.90343OpenAlexW1991220384MaRDI QIDQ1762021
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.05.017
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic programming algorithms for the zero-one knapsack problem
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
- Heuristic and exact algorithms for the precedence-constrained knapsack problem
- A pegging approach to the precedence-constrained knapsack problem
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem
- Discrete Dynamic Programming and Capital Allocation
- The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance
- An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
- Merging and Sorting Applied to the Zero-One Knapsack Problem
- Computing Partitions with Applications to the Knapsack Problem
- Approximation Algorithms for Certain Scheduling Problems
- A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
This page was built for publication: Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
