Edward Rothberg

According to our database1, Edward Rothberg authored at least 26 papers between 1989 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Presolve Reductions in Mixed Integer Programming.
INFORMS J. Comput., 2020

2007
An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions.
INFORMS J. Comput., 2007

Progress in computational mixed integer programming - A look back from the other side of the tipping point.
Ann. Oper. Res., 2007

2005
Exploring relaxation induced neighborhoods to improve MIP solutions.
Math. Program., 2005

2004
Mixed-Integer Programming: A Progress Report.
Proceedings of the Sharpest Cut, 2004

2003
Latency, Occupancy, and Bandwidth in DSM Multiprocessors: A Performance Evaluation.
IEEE Trans. Computers, 2003

1999
Efficient Methods for Out-of-Core Sparse Cholesky Factorization.
SIAM J. Sci. Comput., 1999

MIP: Theory and Practice - Closing the Gap.
Proceedings of the System Modelling and Optimization: Methods, 1999

1998
Node Selection Strategies for Bottom-Up Sparse Matrix Ordering.
SIAM J. Matrix Anal. Appl., July, 1998

Improving the Run Time and Quality of Nested Dissection Ordering.
SIAM J. Sci. Comput., 1998

Sparse Matrix Ordering Methods for Interior Point Linear Programming.
INFORMS J. Comput., 1998

1997
Effective Sparse Matrix Ordering: Just Around the BEND.
Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

1996
Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers.
SIAM J. Sci. Comput., 1996

Gigaflops in linear programming.
Oper. Res. Lett., 1996

1995
Alternatives for Solving Sparse Triangular Systems on Distributed-Memory Multiprocessors.
Parallel Comput., 1995

Efficient Parallel Sparse Cholesky Factorization.
Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, 1995

1994
An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization.
SIAM J. Sci. Comput., 1994

Modeling Communication in Parallel Algorithms: A Fruitful Interaction Between Theory and Systems?
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

Improved load distribution in parallel sparse Cholesky factorization.
Proceedings of the Proceedings Supercomputing '94, 1994

1993
An Evaluation of Left-Looking, Right-Looking and Multifrontal Approaches to Sparse Cholesky Factorization on Hierarchical-Memory Machines.
Int. J. High Speed Comput., 1993

Working Sets, Cache Sizes, and Node Granularity Issues for Large-Scale Multiprocessors.
Proceedings of the 20th Annual International Symposium on Computer Architecture, 1993

1992
Exploiting the memory hierarchy in sequential and parallel sparse Cholesky factorization.
PhD thesis, 1992

Parallel ICCG on a hierarchical memory multiprocessor - Addressing the triangular solve bottleneck.
Parallel Comput., 1992

1991
Efficient sparse matrix factorization on high performance workstations - exploiting the memory hierarchy.
ACM Trans. Math. Softw., 1991

1990
Techniques for improving the performance of sparse matrix factorization on multiprocessor workstations.
Proceedings of the Proceedings Supercomputing '90, New York, NY, USA, November 12-16, 1990, 1990

1989
Experiences Implementing a Parallel ATMS on a Shared-Memory Multiprocessor.
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989


  Loading...