Computing Karmarkar's projections in stochastic linear programming (Q1288215): Difference between revisions

@@ Property / DOI @@
-.1007/s11766-998-0053-z
@@ Property / DOI: 10.1007/s11766-998-0053-z / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11766-998-0053-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2054912360
@@ Property / OpenAlex ID: W2054912360 / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Efficient solution of two-stage stochastic linear programs using interior point methods
+Normal rank
@@ Property / cites work @@
+Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming
+Normal rank
@@ Property / cites work @@
+Prior reduced fill-in in solving equations in interior point algorithms
+Normal rank
@@ Property / cites work @@
+Computational experience with a primal-dual interior point method for linear programming
+Normal rank
@@ Property / cites work @@
+Formulating Two-Stage Stochastic Programs for Interior Point Methods
+Normal rank
@@ Property / cites work @@
+Q5185900
@@ Property / cites work: Q5185900 / rank @@
+Normal rank
@@ Property / cites work @@
+An implementation of Karmarkar's algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. I: Linear programming
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. II: Convex quadratic programming
+Normal rank
@@ Property / DOI @@
+.1007/S11766-998-0053-Z
@@ Property / DOI: 10.1007/S11766-998-0053-Z / rank @@
+Normal rank