Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5368791
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations |
scientific article; zbMATH DE number 5368791 |
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
0 references
0 references
0 references
0.8747353553771973
0 references
0.869236946105957
0 references
0.8272877931594849
0 references
0.8220425248146057
0 references
