PageRank Method for Benchmarking Computational Problems and their Solvers
In this short note, we propose a new tool for benchmarking computational problems and their solvers. The proposed tool, which is a version of the PageRank method, is illustrated using an example to demonstrate its viability and suitability for applications
Keywords: Benchmarking, Software, Solvers, PageRank
Download Full-Text
ABOUT THE AUTHOR
Joseph Gogodze
. Joseph Gogodze received his PhD degree from V.Steklov Mathematical Institute, Moscow, in 1980. At present, he is working as a Senior Researcher at the Institute of Control System of Georgian Technical University, Georgia, and a Chief Researcher at Institute TECHINFORMI of the same university. For a number of years, he is participated in theoretical and practical research projects in Georgia. Areas of his research interest are optimization theory, calculus of variation, operation research and mathematical modelling.
Joseph Gogodze
. Joseph Gogodze received his PhD degree from V.Steklov Mathematical Institute, Moscow, in 1980. At present, he is working as a Senior Researcher at the Institute of Control System of Georgian Technical University, Georgia, and a Chief Researcher at Institute TECHINFORMI of the same university. For a number of years, he is participated in theoretical and practical research projects in Georgia. Areas of his research interest are optimization theory, calculus of variation, operation research and mathematical modelling.
