Malayer Branch, Malayer
West Indies
Research Article
Solver Independent Modelling of Combinatorial and Optimization Problems
Author(s): Reza RafehReza Rafeh
Combinatorial optimization problems appear in many real life applications as timetabling, planning and scheduling. However, they are often NP-hard. This means that there is no general and efficient algorithm for solving them. Modern approaches for tackling combinatorial and optimization problems divide the task into two major tasks: modeling and solving. Modelling means finding a proper formulation of the problem while solving means finding the solution of the problem. The most well-known modeling tools are: constraint programming languages, constraint libraries, (mathematical) modelling languages and specification languages. Modelling languages provide the most high-level practical level of modelling for modellers. There are some known solving techniques to tackle such problems of which the most popular ones are: mathematical methods, constraint progr.. Read More»
DOI:
10.4172/jcsb.1000063
Journal of Computer Science & Systems Biology received 2279 citations as per Google Scholar report