The following pages link to Edward Rothberg (Q537579):
Displaying 17 items.
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point (Q537580) (← links)
- Parallel ICCG on a hierarchical memory multiprocessor -- Addressing the triangular solve bottleneck (Q1195138) (← links)
- Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074) (← links)
- Gigaflops in linear programming (Q1919182) (← links)
- (Q2712822) (← links)
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions (Q2892364) (← links)
- Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
- (Q3489508) (← links)
- Improving the Run Time and Quality of Nested Dissection Ordering (Q4210424) (← links)
- An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization (Q4316313) (← links)
- (Q4327525) (← links)
- Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy (Q4371764) (← links)
- Node Selection Strategies for Bottom-Up Sparse Matrix Ordering (Q4389099) (← links)
- Efficient Methods for Out-of-Core Sparse Cholesky Factorization (Q4702375) (← links)
- (Q4860184) (← links)
- Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers (Q4883665) (← links)
- (Q5465123) (← links)
