Reformulating nonlinear combinatorial optimization problems for higher computational efficiency (Q1194735): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:29, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reformulating nonlinear combinatorial optimization problems for higher computational efficiency |
scientific article |
Statements
Reformulating nonlinear combinatorial optimization problems for higher computational efficiency (English)
0 references
6 October 1992
0 references
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.
0 references
equivalent formulation
0 references
