Principles and Practice of Constraint Programming – CP 2003
From MaRDI portal
Publication:5897220
DOI10.1007/b13743zbMath1273.90176MaRDI QIDQ5897220
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
68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)
90C27: Combinatorial optimization
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Global propagation of side constraints for solving over-constrained problems, Local search with edge weighting and configuration checking heuristics for minimum vertex cover, Some spin glass ideas applied to the clique problem, A logical approach to efficient Max-SAT solving, An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem, Exploiting semidefinite relaxations in constraint programming, A New Approach to the Stable Set Problem Based on Ellipsoids, A Max-SAT Inference-Based Pre-processing for Max-Clique
Uses Software