A linearization procedure for quadratic and cubic mixed-integer problems
Operations Research - Supplement
A linearization method for mixed 0-1 polynomial programs
Computers and Operations Research
Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
Discrete Optimization
A new linearization technique for multi-quadratic 0-1 programming problems
Operations Research Letters
A simple recipe for concise mixed 0-1 linearizations
Operations Research Letters
A computational study on the quadratic knapsack problem with multiple constraints
Computers and Operations Research
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
Computers and Operations Research
Hi-index | 0.00 |
We show how recent linearization methods for mixed 0-1 polynomial programs can be improved and unified through an interpretation of classical techniques. We consider quadratic expressions involving the product of a linear function and a binary variable, and extensions having products of binary variables. Computational results are reported.