Benchmarking Global Optimization and Constraint Satisfaction Codes
نویسندگان
چکیده
A benchmarking suite describing over 1000 optimization problems and constraint satisfaction problems covering problems from different traditions is described, annotated with best known solutions, and accompanied by recommended benchmarking protocols for comparing test results.
منابع مشابه
Global Constraints in Distributed Constraint Satisfaction and Optimization
Global constraints are an essential component in the efficiency of centralized constraint programming. We propose to include global constraints in distributed constraint satisfaction and optimization problems (DisCSPs and DCOPs). We detail how this inclusion can be done, considering different representations for global constraints (direct, nested, binary). We explore the relation of global cons...
متن کاملSolving the Weighted Constraint Satisfaction Problems Via the Neural Network Approach
A wide variety of real world optimization problems can be modelled as Weighted Constraint Satisfaction Problems (WCSPs). In this paper, we model this problem in terms of in original 0-1 quadratic programming subject to leaner constraints. View it performance, we use the continuous Hopfield network to solve the obtained model basing on original energy function. To validate our model, we solve se...
متن کاملA Local Search Framework for Semiring-Based Constraint Satisfaction Problems
Solving semiring-based constraint satisfaction problem (SCSP) is a task of finding the best solution, which can be viewed as an optimization problem. Current research of SCSP solution methods focus on tree search algorithms, which is computationally intensive. In this paper, we present an efficient local search framework for SCSPs, which adopts problem transformation and soft constraint consist...
متن کاملOn the Complexity of Global Constraint Satisfaction
We study the computational complexity of decision and optimization problems that may be expressed as boolean contraint satisfaction problem with the global cardinality constraints. In this paper we establish a characterization theorem for the decision problems and derive approximation hardness results for the corresponding global optimization problems.
متن کاملCertificates of infeasibility via nonsmooth optimization
An important aspect in the solution process of constraint satisfaction problems is to identify exclusion boxes which are boxes that do not contain feasible points. This paper presents a certificate of infeasibility for finding such boxes by solving a linearly constrained nonsmooth optimization problem. Furthermore, the constructed certificate can be used to enlarge an exclusion box by solving a...
متن کامل