Pages that link to "Item:Q4427319"
From MaRDI portal
The following pages link to Parallelizing the Dual Simplex Method (Q4427319):
Displaying 18 items.
- Efficient GPU-based implementations of simplex type algorithms (Q902763) (← links)
- Towards a practical parallelisation of the simplex method (Q970132) (← links)
- Analysis of stochastic problem decomposition algorithms in computational grids (Q1026583) (← links)
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
- ASYNPLEX, an asynchronous parallel revised simplex algorithm (Q1265868) (← links)
- A parallel primal-dual simplex algorithm (Q1591540) (← links)
- Investigating the sparse simplex algorithm on a distributed memory multiprocessor (Q1606889) (← links)
- Parallel search paths for the simplex algorithm (Q1642812) (← links)
- Parallelizing the dual revised simplex method (Q1646685) (← links)
- On the essence of parallel independence for the double-pushout and sesqui-pushout approaches (Q1708174) (← links)
- SIMPAR: A parallel sparse simplex (Q1900665) (← links)
- Gigaflops in linear programming (Q1919182) (← links)
- Could we use a million cores to solve an integer program? (Q1935943) (← links)
- Using massively parallel computations for absolutely precise solution of the linear programming problems (Q2261711) (← links)
- A parallel implementation of the simplex function minimization routine (Q2461663) (← links)
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
- Advances in the Parallelization of the Simplex Method (Q3464476) (← links)
- Generalized Networks: Parallel Algorithms and an Empirical Analysis (Q4030785) (← links)
