On the best case performance of hit and run methods for detecting necessary constraints (Q1186280)
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: On the best case performance of hit and run methods for detecting necessary constraints |
scientific article; zbMATH DE number 36379
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the best case performance of hit and run methods for detecting necessary constraints |
scientific article; zbMATH DE number 36379 |
Statements
On the best case performance of hit and run methods for detecting necessary constraints (English)
0 references
28 June 1992
0 references
linear inequalities
0 references
redundancy
0 references
hit and run methods
0 references
probabilistic algorithms
0 references
systems of linear constraints
0 references
statistical performance
0 references
number of iterations
0 references
sampling problems
0 references
coupon collector's problem
0 references
0 references
0 references
0 references
0 references
0.7742940783500671
0 references
0.753833532333374
0 references
0.7454411387443542
0 references
0.7441098690032959
0 references
