Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:23, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational aspects of a branch and bound algorithm for quadratic zero- one programming |
scientific article |
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
