Approximating the 2-catalog segmentation problem using semidefinite programming relaxations (Q4650629)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating the 2-catalog segmentation problem using semidefinite programming relaxations |
scientific article; zbMATH DE number 2134959
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the 2-catalog segmentation problem using semidefinite programming relaxations |
scientific article; zbMATH DE number 2134959 |
Statements
Approximating the 2-catalog segmentation problem using semidefinite programming relaxations (English)
0 references
18 February 2005
0 references
0 references
0 references
0 references
