Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
A technique for the equivalent formulation of 0-1 nonlinear optimization problems is proposed. Quadratic and cubic cross-product expressions on 0- 1 variables are linearized with only \(n\) extra linear constraints. Numerical examples and comparative computational results are given.
scientific article; zbMATH DE number 68475
scientific article