A Polynomial Time Algorithm for Shaped Partition Problems (Q4702337): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s1052623497344002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016814046 / rank | |||
Normal rank | |||
Latest revision as of 10:27, 30 July 2024
scientific article; zbMATH DE number 1368664
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial Time Algorithm for Shaped Partition Problems |
scientific article; zbMATH DE number 1368664 |
Statements
A Polynomial Time Algorithm for Shaped Partition Problems (English)
0 references
24 November 1999
0 references
cluster
0 references
optimization
0 references
convex
0 references
polytope
0 references
enumeration
0 references
polynomial time
0 references
separation
0 references
shaped partition problems
0 references
