Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058)
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: Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope |
scientific article; zbMATH DE number 6636291
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope |
scientific article; zbMATH DE number 6636291 |
Statements
Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (English)
0 references
7 October 2016
0 references
scheduling polytope
0 references
Carathéodory's theorem
0 references
zonotopes
0 references
0.8870834
0 references
0.88231117
0 references
0.8775426
0 references
0.8694628
0 references
0.86933774
0 references
0.86747164
0 references
0.86554146
0 references
