A provable better Branch and Bound method for a nonconvex integer quadratic programming problem (Q1765223): 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.1016/j.jcss.2004.07.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035506911 / rank | |||
Normal rank | |||
Revision as of 18:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A provable better Branch and Bound method for a nonconvex integer quadratic programming problem |
scientific article |
Statements
A provable better Branch and Bound method for a nonconvex integer quadratic programming problem (English)
0 references
23 February 2005
0 references
Nonconvex integer quadratic programming
0 references
branch and bound
0 references
Complete enumeration
0 references
