Solving the minimum convex partition of point sets with integer programming (Q824341)
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: Solving the minimum convex partition of point sets with integer programming |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the minimum convex partition of point sets with integer programming |
scientific article |
Statements
Solving the minimum convex partition of point sets with integer programming (English)
0 references
15 December 2021
0 references
computational geometry
0 references
combinatorial optimization
0 references
minimum convex partition
0 references
0 references
0 references
0 references
0 references
0.9235631823539734
0 references
0.8065648078918457
0 references
0.8065648078918457
0 references
0.7992072701454163
0 references
0.774959146976471
0 references
