Approximating the 2-catalog segmentation problem using semidefinite programming relaxations (Q4650629): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 17:45, 5 March 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
