A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229): Difference between revisions
From MaRDI portal
Latest revision as of 21:01, 17 December 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
0 references
0 references
0 references
0 references
0 references
0 references