A new variable reduction technique for convex integer quadratic programs

DOI10.1016/j.apm.2006.11.011zbMath1187.90211OpenAlexW2068464776MaRDI QIDQ2472944

Bin Zhang, Xiaoyan Xu, Zhongsheng Hua

Publication date: 25 February 2008

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2006.11.011

zbMATH Keywords

convex quadratic programmingquadratic knapsack problemvariable reductioninteger quadratic programming

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10) Quadratic programming (90C20)

Related Items

A multi-objective production smoothing model with compressible operating times ⋮ On the ERA ranking representability of pairwise bipartite ranking functions ⋮ Global optimality conditions and optimization methods for quadratic integer programming problems ⋮ HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights ⋮ Reducing the number of variables in integer quadratic programming problem

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
• Dynamic programming algorithms for the optimal cutting of equal rectangles
• An approximate dynamic programming approach to convex quadratic knapsack problems
• Randomly Generated Test Problems for Positive Definite Quadratic Programming
• Exact Solution of the Quadratic Knapsack Problem
• Aggregate line capacity design for PWB assembly systems
• Bimatrix Equilibrium Points and Mathematical Programming
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems