Pages that link to "Item:Q4287600"
From MaRDI portal
The following pages link to Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup (Q4287600):
Displaying 4 items.
- Towards a practical parallelisation of the simplex method (Q970132) (← links)
- Applying steepest-edge techniques to a network primal-dual algorithm (Q1362969) (← links)
- Efficient parallel algorithms for the minimum cost flow problem (Q1379929) (← links)
- An extreme‐point tabu‐search algorithm for fixed‐charge network problems (Q6087082) (← links)