Finite Domain Propagation

Traditional methods such as the finite difference method fdm and the finite element method fem have been extensively used in the analysis of solids and structures and of heat transfer phenomena and fluids.

Finite domain propagation. A very general method to tackle discrete combinatorial optimization problems. The core of a finite domain propagation solver are the propagators which given a constraint cand a domain drepresenting the set. This immediately results in strong nogoods for finite.

Systems at least offer services for finite domains. Introduction finite domain propagation is a powerful approach to solving com plex combinatorial satisfaction and optimization problems. Much of the known principles and techniques are conceived and documented for finite domains.

This chapter focuses on the propagation based finite domain constraint programming systems that is systems that solve problems using constraint propagation involving variables ranging over some finite set of integers. This straightforward approach was used to develop and validate the model in the ecl i. The focus on finite domain constraint programming systems coincides with both practical relevance and known principles and techniques.

Keywords finite domain propagation separation logic global constraints 1. However the very fine discretization required and the usage of low order approximation polynomials are major disadvantages because they lead to huge algebraic systems and thus increase the computational effort.