A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02331934.2017.1391253 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2766089206 / rank | |||
Normal rank | |||
Revision as of 23:19, 19 March 2024
scientific article; zbMATH DE number 6865939
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems |
scientific article; zbMATH DE number 6865939 |
Statements
A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (English)
0 references
3 May 2018
0 references
branch-and-cut algorithm
0 references
nonconvex quadratically constrained quadratic programming
0 references
polar cut
0 references
semidefinite relaxation
0 references
