A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127201335, #quickstatements; #temporary_batch_1722426648791 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127201335 / rank | |||
Normal rank | |||
Revision as of 12:54, 31 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for mixed-integer bilinear programming |
scientific article |
Statements
A branch-and-cut algorithm for mixed-integer bilinear programming (English)
0 references
8 January 2020
0 references
combinatorial optimization
0 references
mixed-integer quadratic programming
0 references
bilinear programming
0 references
branch-and-cut algorithms
0 references
intersection cuts
0 references
0 references
0 references
0 references
0 references
