Reducing the number of variables in integer quadratic programming problem

DOI10.1016/j.apm.2009.06.029zbMath1185.90155OpenAlexW2045604168MaRDI QIDQ967821

Minjin Zhou, Wei Chen

Publication date: 2 May 2010

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

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

zbMATH Keywords

variable reductioninteger quadratic programmingseparable integer quadratic programming

Mathematics Subject Classification ID

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

Related Items (1)

Simple solution methods for separable mixed linear and quadratic knapsack problem

Cites Work

• A note on dominance relation in unbounded knapsack problems
• Reducing the number of variables in integer and linear programming problems
• A note on reducing the number of variables in integer programming problems
• A new variable reduction technique for convex integer quadratic programs
• Dynamic programming algorithms for the optimal cutting of equal rectangles
• The Elimination of Integer Variables
• Aggregate line capacity design for PWB assembly systems

This page was built for publication: Reducing the number of variables in integer quadratic programming problem