The following pages link to J. A. J. Hall (Q970131):
Displaying 12 items.
- Towards a practical parallelisation of the simplex method (Q970132) (← links)
- ASYNPLEX, an asynchronous parallel revised simplex algorithm (Q1265868) (← links)
- Ordering algorithms for irreducible sparse linear systems (Q1309854) (← links)
- Parallelizing the dual revised simplex method (Q1646685) (← links)
- The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling (Q1890306) (← links)
- Solving large-scale optimization problems related to Bell's theorem (Q2252425) (← links)
- Novel update techniques for the revised simplex method (Q2352418) (← links)
- Parallel distributed-memory simplex for large-scale stochastic LP problems (Q2393649) (← links)
- Hyper-sparsity in the revised simplex method and how to exploit it (Q2490370) (← links)
- (Q3479462) (← links)
- Calmness of partially perturbed linear systems with an application to the central path (Q4634160) (← links)
- The ‘Idiot’ crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems (Q5113712) (← links)
