Reformulating nonlinear combinatorial optimization problems for higher computational efficiency (Q1194735)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 68475
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reformulating nonlinear combinatorial optimization problems for higher computational efficiency |
scientific article; zbMATH DE number 68475 |
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
0 references
0 references
0 references
0 references
0 references
0.8381908535957336
0 references
0.7798006534576416
0 references
0.7781504988670349
0 references
0.771938145160675
0 references
0.7679584622383118
0 references
