An approximate dynamic programming approach to convex quadratic knapsack problems

DOI10.1016/j.cor.2004.07.012zbMath1077.90054OpenAlexW1992916292MaRDI QIDQ2566930

Liang Liang, Bin Zhang, Zhongsheng Hua

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

heuristicsquadratic knapsack problemapproximate dynamic programming

Mathematics Subject Classification ID

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

Related Items

Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, A unified method for a class of convex separable nonlinear knapsack problems, A new variable reduction technique for convex integer quadratic programs, HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM, Simple solution methods for separable mixed linear and quadratic knapsack problem, Capacity-constrained multiple-market price discrimination

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and search algorithm for a class of nonlinear knapsack problems
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
• Min-cut clustering
• A semidefinite programming approach to the quadratic knapsack problem
• The nonlinear knapsack problem - algorithms and applications
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• The quadratic 0-1 knapsack problem with series-parallel support
• Approximation algorithms for fractional knapsack problems
• A nonlinear knapsack problem
• An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• Quadratic knapsack problems
• Exact Solution of the Quadratic Knapsack Problem
• Aggregate line capacity design for PWB assembly systems
• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
• Bimatrix Equilibrium Points and Mathematical Programming
• Quadratic Binary Programming with Application to Capital-Budgeting Problems