An efficient branch and bound algorithm to solve the quadratic integer programming problem (Q1169260): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5648149 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Discrete optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Verfahren znr lösung ganzzahliger nichtlinearer optimierungsprobleme / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: There Cannot be any Algorithm for Integer Programming with Quadratic Constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ein Branch-and-Bound-Verfahren-Generator. (A branch-and-bound method generator) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4118986 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5584922 / rank | |||
Normal rank | |||
Latest revision as of 16:52, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient branch and bound algorithm to solve the quadratic integer programming problem |
scientific article |
Statements
An efficient branch and bound algorithm to solve the quadratic integer programming problem (English)
0 references
1983
0 references
integer quadratic programming
0 references
branch and bound
0 references
numerical tests
0 references
