A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:09, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A binarisation heuristic for non-convex quadratic programming with box constraints |
scientific article |
Statements
A binarisation heuristic for non-convex quadratic programming with box constraints (English)
0 references
10 February 2020
0 references
global optimisation
0 references
heuristics
0 references
integer programming
0 references
