On polynomial complexity of a stochastic algorithm for mixed zero-one programs. (Q1421463): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4097679
@@ Property / cites work: Q4097679 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5842591
@@ Property / cites work: Q5842591 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5624436
@@ Property / cites work: Q5624436 / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+Q5647750
@@ Property / cites work: Q5647750 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized rounding: A technique for provably good algorithms and algorithmic proofs
+Normal rank
@@ Property / cites work @@
+The multivariate normal distribution
@@ Property / cites work: The multivariate normal distribution / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0166-218x(03)00301-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2049573696
@@ Property / OpenAlex ID: W2049573696 / rank @@
+Normal rank