What is it about?
MCI problem is considered as a hard problem in mathematics and theoretical computer science. The reason is that no algorithm or solution technique is known to find the exact solution of the larger instances of this problem in reasonable amount of time. In this article we have proposed different ways to solve larger instances of the MCI problem by consuming less time than the existing techniques.
Featured Image
Why is it important?
By the contribution of this article larger instances of the MCI problem can be solved in less time in comparison to the earlier techniques. This fact has been endorsed by conducting different computational tests on the randomly generated instances of this problem.
Perspectives
In my view this article is an important step towards the solution of a hard problem of Optimization. Since the origin of the problem is multidisciplinary so many scientific communities can gain from this work. Bioinformatics, computer science and mathematics are some major areas which are beneficiary of this research.
Dr Muhammad Abid Dar
University of Gujrat
Read the Original
This page is a summary of: An improved flow-based formulation and reduction principles for the minimum connectivity inference problem, Optimization, April 2018, Taylor & Francis,
DOI: 10.1080/02331934.2018.1465944.
You can read the full text:
Contributors
The following have contributed to this page
