How to synthesize molecules is a fundamental and well studied problem in chemistry. However, computer aided methods are still under-utilized in chemical synthesis planning. Given a specific chemistry (a set of chemica...
详细信息
We present a novel approach to the Traveling Purchaser Problem (TPP), based on constraintprogramming and Lagrangean relaxation. the TPP is a generalization of the Traveling Salesman Problem involved in many real-worl...
详细信息
Tractable classes of binary CSP and binary Max-CSP have recently been discovered by studying classes of instances defined by excluding subproblems. In this paper we characterise the complexity of all classes of binary...
详细信息
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-...
详细信息
Two competing approaches to handling complex constraints in satisfaction and optimization problems using SAT and LCG/SMT technology are: decompose the complex constraint into a set of clauses;or (theory) propagate the...
详细信息
Bounded Max-Sum is a message-passing algorithm for solving Distributed constraint Optimization Problems able to compute solutions with a guaranteed approximation ratio. Although its approximate solutions were empirica...
详细信息
We present an extension to indexicals to describe propagators for global constraints. the resulting language is compiled into actual propagators for different solvers, and is solver-independent. In addition, we show h...
详细信息
Weighted average expressions frequently appear in the context of allocation problems with balancing based constraints. In combinatorial optimization they are typically avoided by exploiting problems specificities or b...
详细信息
Parallelization offers the opportunity to accelerate search on constraint satisfaction problems. To parallelize a sequential solver under a popular message passing protocol, the new paradigm described here combines po...
详细信息
Our goal is to investigate the definition and application of strong consistency properties on the dual graphs of binary constraint Satisfaction Problems (CSPs). As a first step in that direction, we study the structur...
详细信息
暂无评论