scientific article; zbMATH DE number 6869279

MaRDI QIDQ4640248zbMATH OpenFDO

Authors Xueqi He, Joseph C. Hartman, Panos M. Pardalos

Publication date 17 May 2018

Full work available at URL https://content.iospress.com/articles/informatica/inf1098

zbMATH Keywords

dynamic programminginteger programmingunbounded knapsack problemvalid inequalities

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• Unbounded knapsack problem: Dynamic programming revisited
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• An exact algorithm for large unbounded knapsack problems
• Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
• An empirical analysis of exact algorithms for the unbounded knapsack problem
• Dynamic programming algorithms for the bi-objective integer knapsack problem
• Tight bounds for periodicity theorems on the unbounded knapsack problem
• A constructive periodicity bound for the unbounded knapsack problem
• Improved dynamic programming and approximation results for the knapsack problem with setups
• The dynamic and stochastic knapsack problem

Cited in

(6)

• A hybrid algorithm for the unbounded knapsack problem
• A constructive periodicity bound for the unbounded knapsack problem
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• scientific article; zbMATH DE number 936863 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640248)