the constraint propagation process is a powerful tool for solving constraint satisfaction problems (CSPs). We propose a filtering technique which exploits at best this tool in order to improve the pruning efficiency. ...
详细信息
Nowadays, constraint processing has become a mayor issue in engineering applications based on digital product models. A modern product naturally decomposes into numerous subcomponents, the physical behaviour of which ...
详细信息
the Stable Marriage problem (SM) is an extensively-studied combinatorial problem with many practical applications. In this paper we present two encodings of an instance I of SM as an instance J of a constraint Satisfa...
详细信息
One of the key factors in the efficiency of backtracking algorithms is the rule they use to decide on which variable to branch next (namely, the variable ordering heuristics). In this paper, we give a formulation of d...
详细信息
In recent years, many constraint-specific filtering algorithms have been introduced. Such algorithms use the semantics of the constraint to perform filtering more efficiently than a generic algorithm. the usefulness o...
详细信息
Benders Decomposition is a form of hybridisation that allows linear programming to be combined with other kinds of algorithms. It extracts new constraints for one subproblem from the dual values of the other subproble...
详细信息
Lattice protein models are used for hierarchical approaches to protein structure prediction, as well as for investigating principles of protein folding. So far, one has the problem that there exists no lattice that ca...
详细信息
Column Generation is a powerful method used to solve Constrained Set Partitioning problems. this method can be decomposed in two parts:the master problem and the sub-problem. the Master Problem that should be solved i...
ISBN:
(纸本)3540428631
Column Generation is a powerful method used to solve Constrained Set Partitioning problems. this method can be decomposed in two parts:the master problem and the sub-problem. the Master Problem that should be solved in Column Generation is derived from a simple Set Partitioning problem. Depending on the context the subproblem may become a variant of the simple Shortest-Path Problem; applications in scheduling generally present an acyclic graph (since one dimension of the graph is time) as opposed to routing problems that are cyclic by nature. However, most real life applications present resource constrained sub problems, typical resources being time, capacity, money, etc.
this paper describes a filtering algorithm for a type of constraintthat often arises in rostering problems but that also has wider application. Defined on a sequence of variables, the stretch constraint restricts the...
详细信息
In this paper, we present a domain specific optimization framework based on a concurrent model-based approach for handling the complete problem of mapping a DSP application on a parallel architecture. the implementati...
详细信息
暂无评论