Dynamic programming based algorithms for the discounted \0-1\ knapsack problem
From MaRDI portal
Publication:428109
Recommendations
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem
- A dynamic programming algorithm for the discounted \(\{0 - 1\}\) knapsack problem with setup
- A dynamic programming algorithm for the knapsack problem with setup
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 1423920 (Why is no real title available?)
- A Finite Renewal Algorithm for the Knapsack and Turnpike Models
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A fast algorithm for strongly correlated knapsack problems
- An Algorithm for Large Zero-One Knapsack Problems
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Infinite Horizon Optimization
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
- Where are the hard knapsack problems?
Cited in
(16)- scientific article; zbMATH DE number 6869279 (Why is no real title available?)
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- scientific article; zbMATH DE number 1423920 (Why is no real title available?)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- A dynamic programming algorithm for the discounted \(\{0 - 1\}\) knapsack problem with setup
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- An iterative dynamic programming approach for the temporal knapsack problem
- Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem
- Dynamic programming algorithm with objective level cut for nonlinear knapsack problem
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
- New upper bounds and exact methods for the knapsack sharing problem
This page was built for publication: Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428109)
