On the exhaustivity of simplicial partitioning (Q2442641)
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 6276339
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the exhaustivity of simplicial partitioning |
scientific article; zbMATH DE number 6276339 |
Statements
On the exhaustivity of simplicial partitioning (English)
0 references
1 April 2014
0 references
nonconvex programming
0 references
simplices
0 references
partitioning
0 references
exhaustivity
0 references
0 references
0 references
0 references
0.7805958390235901
0 references
0.7463214993476868
0 references
0.7454420924186707
0 references
0.7354039549827576
0 references
0.7328312397003174
0 references
