A provable better Branch and Bound method for a nonconvex integer quadratic programming problem (Q1765223): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A note on adapting methods for continuous global optimization to the discrete case / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3667913 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for indefinite integer quadratic programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5733470 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4321546 / rank | |||
Normal rank | |||
Latest revision as of 18:46, 7 June 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
