Pages that link to "Item:Q902763"
From MaRDI portal
The following pages link to Efficient GPU-based implementations of simplex type algorithms (Q902763):
Displaying 11 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Implementing an interior point method for linear programs on a CPU-GPU system (Q836722) (← links)
- Efficient GPU-based implementations of simplex type algorithms (Q902763) (← links)
- Simulating a P system based efficient solution to SAT by using GPUs (Q987962) (← links)
- A low-space algorithm for the subset-sum problem on GPU (Q1652299) (← links)
- Integer programming for urban design (Q1755415) (← links)
- Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing (Q2397437) (← links)
- Using GPU computing for solving the two-dimensional guillotine cutting problem (Q2830956) (← links)
- Advances in the Parallelization of the Simplex Method (Q3464476) (← links)
- Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
- GPU parameter tuning for tall and skinny dense linear least squares problems (Q5113719) (← links)