A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters (Q2693785)
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: A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters |
scientific article; zbMATH DE number 7667673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters |
scientific article; zbMATH DE number 7667673 |
Statements
A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters (English)
0 references
24 March 2023
0 references
mixed binary quadratic program
0 references
symmetric structure
0 references
branch-and-bound algorithm
0 references
lower bounding method
0 references
global optimization
0 references
0 references
0.7715133428573608
0 references
0.7628362774848938
0 references
0.7554817199707031
0 references
0.7464326024055481
0 references
