Integer quadratic optimization (Q759647)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Integer quadratic optimization |
scientific article; zbMATH DE number 3882199
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Integer quadratic optimization |
scientific article; zbMATH DE number 3882199 |
Statements
Integer quadratic optimization (English)
0 references
1985
0 references
A branch and bound algorithm is considered to solve linearly constrained, integer quadratic optimization problems. The main result consists in devicing a rule to decide in every node of the branch and bound tree which variable is going to branch next such that only a small number of branch and bound nodes need to be investigated. If Fletcher's algorithm is applied to solve continuous partial problems, then only \(O(n^ 2)\) operations are required to find an ''advantageous'' variable for branching.
0 references
branch and bound
0 references
linearly constrained, integer quadratic optimization
0 references
0 references
0 references
0.8226988911628723
0 references
0.8226986527442932
0 references
0.8165516257286072
0 references
0.8086137175559998
0 references
