scientific article; zbMATH DE number 4216294
From MaRDI portal
Publication:3363529
Recommendations
- Random search method for solving series of linear programming problems
- A randomized algorithm for fixed-dimensional linear programming
- A randomized polynomial-time simplex algorithm for linear programming
- scientific article; zbMATH DE number 2047294
- An efficient search direction for linear programming problems
- scientific article; zbMATH DE number 4199967
- scientific article; zbMATH DE number 89065
- Randomized method of successive approximations for solving systems of linear algebraic equations
- scientific article; zbMATH DE number 3898608
- Algorithmes de poursuite pour la résolution de programmes (linéaires) en nombres entiers
Cited in
(7)- Computational behavior of a feasible direction method for linear programming
- Use of random search in solving discrete extremal problems
- scientific article; zbMATH DE number 4199967 (Why is no real title available?)
- A new random group search algorithm for solving the multi-objective programming problems
- SOFTWARE SECTION—RANDMOD: A System for Randomizing Modifications to an Instance of a Linear Program
- scientific article; zbMATH DE number 124850 (Why is no real title available?)
- Pseudorandom search algorithms in problems of optimal choice of parameters of complex econometric models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3363529)