Integrating Constraint Propagation in Complete Solving of Linear Diophantine Systems
نویسندگان
چکیده
Several complete methods for solving linear Diophantine constraints have been proposed. They can handle innnite domains, but their pruning during search is relatively weak. In contrast to those, consistency techniques based constraint propagation provides stronger pruning and have been applied successfully to many combinatorial problems, but are limited to nite domains. This paper studies the combination of (1) a complete solver which is based on a geometric interpretation and (2) propagation techniques. We study the pruning potential created through such a combination, both conceptually and experimentally. In addition, it turns out that dynamic variables orderings can be easily embedded in the method. Our result is an extended solver, which is implemented in Java, based on which we present some interesting features and a few experimental results.
منابع مشابه
Complete Solving of Linear
In this paper, we present an algorithm for solving directly linear Diophantine systems of both equations and inequations. Here directly means without adding slack variables for encoding inequalities as equalities. This algorithm is an extension of the algorithm due to Con-tejean and Devie 9] for solving linear Diophantine systems of equations, which is itself a generalization of the algorithm o...
متن کاملNumerical method for solving optimal control problem of the linear differential systems with inequality constraints
In this paper, an efficient method for solving optimal control problems of the linear differential systems with inequality constraint is proposed. By using new adjustment of hat basis functions and their operational matrices of integration, optimal control problem is reduced to an optimization problem. Also, the error analysis of the proposed method is nvestigated and it is proved that the orde...
متن کاملOn Solving Linear Diophantine Systems Using Generalized Rosser’s Algorithm
A difficulty in solving linear Diophantine systems is the rapid growth of intermediate results. Rosser’s algorithm for solving a single linear Diophatine equation is an efficient algorithm that effectively controls the growth of intermediate results. Here, we propose an approach to generalize Rosser’s algorithm and present two algorithms for solving systems of linear Diophantine equations. Then...
متن کاملThe Sine-Cosine Wavelet and Its Application in the Optimal Control of Nonlinear Systems with Constraint
In this paper, an optimal control of quadratic performance index with nonlinear constrained is presented. The sine-cosine wavelet operational matrix of integration and product matrix are introduced and applied to reduce nonlinear differential equations to the nonlinear algebraic equations. Then, the Newton-Raphson method is used for solving these sets of algebraic equations. To present ability ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998