Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LANCELOT / rank | |||
Normal rank | |||
Revision as of 17:46, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations |
scientific article |
Statements
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (English)
0 references
19 November 2008
0 references
combinatorial optimization
0 references
quadratic 0-1 programming
0 references
linear reformulation
0 references
quadratic convex reformulation
0 references
