Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083)
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: Computational aspects of a branch and bound algorithm for quadratic zero- one programming |
scientific article; zbMATH DE number 4189103
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational aspects of a branch and bound algorithm for quadratic zero- one programming |
scientific article; zbMATH DE number 4189103 |
Statements
Computational aspects of a branch and bound algorithm for quadratic zero- one programming (English)
0 references
1990
0 references
We describe computational experience in solving unconstrained quadratic zero-one problems using a branch and bound algorithm. The algorithm incorporates dynamic preprocessing techniques for forcing variables and heuristics to obtain good starting points. Computational results and comparisons with previous studies on several hundred test problems with dimensions up to 200 demonstrate the efficiency of our algorithm.
0 references
unconstrained quadratic zero-one problems
0 references
branch and bound algorithm
0 references
test problems
0 references
0.9082584381103516
0 references
0.8765129446983337
0 references
0.8744405508041382
0 references
0.844698965549469
0 references
0.8353404998779297
0 references
