On the best case performance of hit and run methods for detecting necessary constraints
From MaRDI portal
(Redirected from Publication:1186280)
Recommendations
Cites work
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A new approach to the analysis of random methods for detecting necessary linear inequality constraints
- Hit-and-run algorithms for the identification of nonredundant linear inequalities
- On the best case performance of hit and run methods for detecting necessary constraints
- Redundancy in mathematical programming. A state-of-the-art survey
- Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra
- The coupon-collector problem revisited — a survey of engineering problems and computational methods
Cited in
(9)- Optimal strategy of coupon subset collection when each package contains half of the coupons
- Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints
- A new approach to the analysis of random methods for detecting necessary linear inequality constraints
- On the best case performance of hit and run methods for detecting necessary constraints
- Notes on ``Hit-and-run enables efficient weight generation for simulation-based multiple criteria decision analysis
- Results and conjectures on the role of the uniform distribution in the coupon collector's problem with group drawings
- Minimal representation of convex regions defined by analytic functions
- Hit-and-run algorithms for feasibility and detection of necessary linear matrix inequality constraints
- Probabilistic algorithms for extreme point identification
This page was built for publication: On the best case performance of hit and run methods for detecting necessary constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186280)
