Solving SAT and Hamiltonian Cycle Problem Using Asynchronous P Systems
نویسندگان
چکیده
منابع مشابه
Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem
We describe a hybrid procedure for solving the traveling salesman problem (TSP) to provable optimality. We first sparsify the instance, and then use a hybrid algorithm that combines a branch-and-cut TSP solver with a Hamiltonian cycle problem solver. We demonstrate that this procedure enables us to solve difficult instances to optimality, including one which had remained unsolved since its cons...
متن کاملAsynchronous Multi-core Incremental SAT Solving
Solvers for propositional logic formulas, so called SAT solvers, are used in many practical applications. As multi-core and multi-processor hardware has become widely available, parallelizations of such solvers are actively researched. Such research typically ignores the incremental problem specification feature that modern SAT solvers possess. This feature is, however, crucial for many of the ...
متن کاملDesign of parallel portfolios for SAT-based solving of Hamiltonian cycle problems
We study portfolios of parallel strategies for Boolean Satisfiability (SAT) based solving of Hamiltonian Cycle Problems (HCPs). The strategies are based on our techniques for relative SAT encoding of permutations with constraints, and exploit: 1) encodings that eliminate half of the ordering Boolean variables and two-thirds of the transitivity constraints; 2) 12 triangulation heuristics for min...
متن کاملSolving Numerically Hamiltonian Systems
where / is a smooth function. The basic theory of numerical methods for (1) has been known for more than thirty years, see e.g. [8]. This theory, in tandem with practical experimentation, has led to the development of general software packages for the efficient solution of (1). It is perhaps remarkable that both the theory and the packages do not take into account any structure the problem may ...
متن کاملSolving the Employee Timetabling Problem Using Advanced SAT & ILP Techniques
The Employee Timetabling Problem (ETP) is concerned with assigning a number of employees into a given set of shifts over a fixed period of time while meeting the employee’s preferences and organizational work regulations. The problem also attempts to optimize the performance criteria and distribute the shifts equally among the employees. The problem is known to be a complex optimization problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2012
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e95.d.746