A new variable reduction technique for convex integer quadratic programs
From MaRDI portal
Publication:2472944
DOI10.1016/J.APM.2006.11.011zbMATH Open1187.90211OpenAlexW2068464776MaRDI QIDQ2472944FDOQ2472944
Authors: Zhong-Sheng Hua, Bin Zhang, Xiaoyan Xu 
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
Recommendations
- Reducing the number of variables in integer quadratic programming problem
- An effective branch-and-bound algorithm for convex quadratic integer programming
- An effective branch-and-bound algorithm for convex quadratic integer programming
- A new branch and bound method for integer quadratic programming problems
- A polynomial case of convex integer quadratic programming problems with box integer constraints
variable reductionconvex quadratic programminginteger quadratic programmingquadratic knapsack problem
Cites Work
- Title not available (Why is that?)
- Bimatrix Equilibrium Points and Mathematical Programming
- An approximate dynamic programming approach to convex quadratic knapsack problems
- Exact Solution of the Quadratic Knapsack Problem
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- Dynamic programming algorithms for the optimal cutting of equal rectangles
- Aggregate line capacity design for PWB assembly systems
- Randomly Generated Test Problems for Positive Definite Quadratic Programming
- Title not available (Why is that?)
Cited In (8)
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- Reducing the number of variables in integer quadratic programming problem
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- A note on reducing the number of variables in integer programming problems
- A multi-objective production smoothing model with compressible operating times
- Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights
- Global optimality conditions and optimization methods for quadratic integer programming problems
- On the ERA ranking representability of pairwise bipartite ranking functions
Uses Software
This page was built for publication: A new variable reduction technique for convex integer quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2472944)
