An approximate dynamic programming approach to convex quadratic knapsack problems

DOI10.1016/J.COR.2004.07.012MaRDI QIDQ2566930zbMATH OpenOpenAlexFDO

Authors Zhong-Sheng Hua, Bin Zhang, Liang Liang

Publication date 29 September 2005

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2004.07.012

zbMATH Keywords

approximate dynamic programmingheuristicsquadratic knapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An approximate dynamic programming approach to multidimensional knapsack problems
• A dynamic programming heuristic for the quadratic knapsack problem
• A lifted-space dynamic programming algorithm for the quadratic knapsack problem
• Quadratic bottleneck knapsack problems
• Fast algorithm for the quadratic knapsack problem

Cites work

• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
• A branch and search algorithm for a class of nonlinear knapsack problems
• A nonlinear knapsack problem
• A semidefinite programming approach to the quadratic knapsack problem
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
• Aggregate line capacity design for PWB assembly systems
• An approximate dynamic programming approach to multidimensional knapsack problems
• Approximation algorithms for fractional knapsack problems
• Bimatrix Equilibrium Points and Mathematical Programming
• Exact Solution of the Quadratic Knapsack Problem
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• scientific article; zbMATH DE number 3718880 (Why is no real title available?)
• scientific article; zbMATH DE number 3783772 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (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?)
• Min-cut clustering
• Quadratic Binary Programming with Application to Capital-Budgeting Problems
• Quadratic knapsack problems
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• The nonlinear knapsack problem - algorithms and applications
• The quadratic 0-1 knapsack problem with series-parallel support

Cited in

(13)

• Capacity-constrained multiple-market price discrimination
• Variable fixing method by weighted average for the continuous quadratic knapsack problem
• Strategic oscillation for the quadratic multiple knapsack problem
• A new variable reduction technique for convex integer quadratic programs
• A dynamic programming heuristic for the quadratic knapsack problem
• An approximate dynamic programming approach to multidimensional knapsack problems
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
• HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
• A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization
• Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem
• Simple solution methods for separable mixed linear and quadratic knapsack problem
• A fix and optimize method based approximate dynamic programming approach for the strategic fleet sizing and delivery planning problem
• A unified method for a class of convex separable nonlinear knapsack problems

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: An approximate dynamic programming approach to convex quadratic knapsack problems

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