Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes (Q4513205)
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: Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes |
scientific article; zbMATH DE number 1526804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes |
scientific article; zbMATH DE number 1526804 |
Statements
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes (English)
0 references
7 November 2000
0 references
linear programming
0 references
assembly planning
0 references
0 references
0.8529150485992432
0 references
0.8517670631408691
0 references
0.8143423199653625
0 references
0.7817970514297485
0 references
0.7815096378326416
0 references
