Pages that link to "Item:Q1821686"
From MaRDI portal
The following pages link to Efficient parallel linear programming (Q1821686):
Displaying 14 items.
- Parallel algorithm for solving linear programming problem under conditions of incomplete data (Q612150) (← links)
- Efficient GPU-based implementations of simplex type algorithms (Q902763) (← links)
- Parallel nested dissection for path algebra computations (Q1095781) (← links)
- Decomposition of linear programs using parallel computation (Q1111935) (← links)
- A parallel algorithm for linear programming problems (Q1176914) (← links)
- On the efficacy of distributed simplex algorithms for linear programming (Q1342885) (← links)
- Gigaflops in linear programming (Q1919182) (← links)
- Using massively parallel computations for absolutely precise solution of the linear programming problems (Q2261711) (← links)
- Efficient algorithm for linear problems using packed data structure with a set of parallel pointers (Q3129718) (← links)
- Efficiency of parallel macropipelined computations in partially blocked linear and 0?1 linear programming problems (Q3770276) (← links)
- Anomalous Acceleration in Parallel Multiple-Cost-Row Linear Programming (Q4020661) (← links)
- Parallel Implementation of Lemke's Algorithm on the Hypercube (Q4025896) (← links)
- (Q4875177) (← links)
- Solving Linear Programs in the Current Matrix Multiplication Time (Q5056400) (← links)