A 3-space dynamic programming heuristic for the cubic knapsack problem

DOI10.1007/S10878-025-01294-3MaRDI QIDQ6976870zbMATH OpenFDO

Authors Ibrahim Dan Dije, Franklin Djeumou Fomeni, Leandro C. Coelho

Publication date 31 May 2025

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-025-01294-3

zbMATH Keywords

cubic knapsack problemdynamic programminginteger programmingknapsack problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• A cut-and-branch algorithm for the quadratic knapsack problem
• A dynamic programming heuristic for the quadratic knapsack problem
• A lifted-space dynamic programming algorithm for the quadratic knapsack problem
• A novel dynamic programming heuristic for the quadratic knapsack problem
• A simple recipe for concise mixed 0-1 linearizations
• An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization
• An Integer Programming Algorithm for Portfolio Selection
• Asymptotic behavior of the quadratic knapsack problem
• Capital Expenditure Programming and Some Alternative Approaches to Risk
• Exact Solution of the Quadratic Knapsack Problem
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 5781599 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• 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
• Linear programming for the \(0-1\) quadratic knapsack problem
• Optimization by simulated annealing
• Quadratic knapsack problems
• Solution of large quadratic knapsack problems through aggressive reduction
• Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering
• The knapsack problem: A survey
• Tightening concise linear reformulations of 0-1 cubic programs

Cited in

(1)

• The latest developments in combinatorial optimization

This page was built for publication: A 3-space dynamic programming heuristic for the cubic knapsack problem

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