Dynamic programming based algorithms for the discounted \0-1\ knapsack problem
DOI10.1016/J.AMC.2011.12.068zbMATH Open1244.65087OpenAlexW1965011664MaRDI QIDQ428109FDOQ428109
Authors: Aiying Rong, Kathrin Klamroth, José Rui Figueira 
Publication date: 19 June 2012
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.12.068
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
dynamic programmingalgorithmnumerical experimentsinteger programmingcore conceptdiscounted knapsack problemproblem partition
Numerical mathematical programming methods (65K05) Group preferences (91B10) Dynamic programming (90C39) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Where are the hard knapsack problems?
- An Algorithm for Large Zero-One Knapsack Problems
- Title not available (Why is that?)
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Title not available (Why is that?)
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Infinite Horizon Optimization
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
- A fast algorithm for strongly correlated knapsack problems
- A Finite Renewal Algorithm for the Knapsack and Turnpike Models
Cited In (16)
- Title not available (Why is that?)
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem
- Title not available (Why is that?)
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- 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
Uses Software
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)
