Dominance breaking is an effective technique to reduce the time for solving constraint optimization problems. Lee and Zhong propose an automatic dominance breaking framework for a class of constraint optimization prob...
详细信息
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.
Model-based applications in engineering, such as diagnosis,configuration or interactive decision-support systems, require embedded constraint solvers with challenging capabilities. Not only consistency checking and so...
详细信息
Filtering algorithms for table constraints are constraint-based, which means that the propagation queue only contains information on the constraints that must be reconsidered. this paper proposes four efficient value-...
详细信息
the Balance constraint introduced by Beldiceanu ensures solutions are balanced. this is useful when, for example, there is a requirement for solutions to be fair. Balance bounds the difference B between the minimum an...
详细信息
this paper introduces a constraint model and solving techniques for code generation in a compiler back-end. It contributes a new model for global register allocation that combines several advanced aspects: multiple re...
详细信息
the problem of transporting vehicle components in a car manufacturer workshop can be seen as a large scale single vehicle pickup and delivery problem with periodic time windows. Our experimental evaluation indicates t...
详细信息
In recent years, there has been much research on local search techniques for solving constraint satisfaction problems, including Boolean satisfiability problems. Some of the most successful procedures combine a form o...
详细信息
this paper revisits the tree constraint introduced in [2] which partitions the nodes of a n-nodes, m-arcs directed graph into a set of node-disjoint anti-arborescences for which only certain nodes can be tree roo...
详细信息
暂无评论