Approximating the 2-catalog segmentation problem using semidefinite programming relaxations (Q4650629): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:25, 7 February 2024
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
