Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem

DOI10.1016/j.amc.2011.12.068zbMath1244.65087OpenAlexW1965011664MaRDI QIDQ428109

Kathrin Klamroth, Aiying Rong, 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

zbMATH Keywords

algorithminteger programmingdynamic programmingnumerical experimentscore conceptdiscounted knapsack problemproblem partition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Dynamic programming (90C39) Group preferences (91B10)

Related Items

Dynamic programming algorithms for the bi-objective integer knapsack problem, Knapsack problems -- an overview of recent advances. I: Single knapsack problems, New upper bounds and exact methods for the knapsack sharing problem, Cognitive discrete gravitational search algorithm for solving 0-1 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, Solving 0-1 knapsack problems based on amoeboid organism algorithm, Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem, Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem, A reduction dynamic programming algorithm for the bi-objective integer knapsack problem

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
• A fast algorithm for strongly correlated knapsack problems
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• Where are the hard knapsack problems?
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Infinite Horizon Optimization
• An Algorithm for Large Zero-One Knapsack Problems
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
• A Finite Renewal Algorithm for the Knapsack and Turnpike Models