On the best case performance of hit and run methods for detecting necessary constraints (Q1186280): Difference between revisions
From MaRDI portal
Revision as of 17:03, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the best case performance of hit and run methods for detecting necessary constraints |
scientific article |
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