Las Vegas algorithms for linear and integer programming when the dimension is small (Q4369872)
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: Las Vegas algorithms for linear and integer programming when the dimension is small |
scientific article; zbMATH DE number 1103537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Las Vegas algorithms for linear and integer programming when the dimension is small |
scientific article; zbMATH DE number 1103537 |
Statements
Las Vegas algorithms for linear and integer programming when the dimension is small (English)
0 references
2 February 1998
0 references
algorithm
0 references
linear programming
0 references
integer linear programming
0 references
convex programming
0 references
smallest sphere
0 references
0.8888148665428162
0 references
0.8790661692619324
0 references
0.8787847757339478
0 references
0.8743512034416199
0 references
