On the best case performance of hit and run methods for detecting necessary constraints (Q1186280): Difference between revisions

@@ Property / author @@
+Richard J. Caron
@@ Property / author: Richard J. Caron / rank @@
+Normal rank
@@ Property / author @@
+Myron Hlynka
@@ Property / author: Myron Hlynka / rank @@
+Normal rank
@@ Property / author @@
+J. Fred McDonald
@@ Property / author: J. Fred McDonald / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Hit-and-run algorithms for the identification of nonredundant linear inequalities
+Normal rank
@@ Property / cites work @@
+Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra
+Normal rank
@@ Property / cites work @@
+The coupon-collector problem revisited — a survey of engineering problems and computational methods
+Normal rank
@@ Property / cites work @@
+A new approach to the analysis of random methods for detecting necessary linear inequality constraints
+Normal rank
@@ Property / cites work @@
+On the best case performance of hit and run methods for detecting necessary constraints
+Normal rank
@@ Property / cites work @@
+Q5538132
@@ Property / cites work: Q5538132 / rank @@
+Normal rank
@@ Property / cites work @@
+Redundancy in mathematical programming. A state-of-the-art survey
+Normal rank