DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s11590-017-1203-0 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11590-017-1203-0 / rank | |||
Normal rank | |||
Latest revision as of 02:07, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs |
scientific article |
Statements
DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (English)
0 references
31 July 2018
0 references
quadratic program
0 references
difference-of-convex
0 references
branch-and-bound algorithm
0 references
global optimization
0 references
convex relaxation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
