A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q129270668, #quickstatements; #temporary_batch_1730844483834 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.orl.2018.08.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ORL.2018.08.005 / rank | |||
Normal rank | |||
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
