Principles and Practice of Constraint Programming – CP 2003

DOI10.1007/b13743zbMath1273.68368OpenAlexW2497660909MaRDI QIDQ5897208

Javier Larrosa, Simon de Givry, Thomas Schiex, Pedro Meseguer

Publication date: 2 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13743

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Algorithms for Solving Satisfiability Problems with Qualitative Preferences, A logical approach to efficient Max-SAT solving, Solving satisfiability problems with preferences, A Max-SAT Inference-Based Pre-processing for Max-Clique, Incomplete inference for graph problems, A taxonomy of exact methods for partial Max-SAT, On Inconsistent Clause-Subsets for Max-SAT Solving, Scatter search and genetic algorithms for MAX-SAT problems, Combining VNS with constraint programming for solving anytime optimization problems, An efficient solver for weighted Max-SAT, MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability, Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques, Exact MAX-2SAT solution via lift-and-project closure, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, A branch and bound algorithm for numerical Max-CSP, Evaluating the impact of AND/OR search on 0-1 integer linear programming, Exact Max-SAT solvers for over-constrained problems, Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP, A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem, Iterative and core-guided maxsat solving: a survey and assessment, Improving exact algorithms for MAX-2-SAT, Arc consistency for soft constraints, A proof builder for Max-SAT

Uses Software

• CPLEX