Principles and Practice of Constraint Programming – CP 2003
From MaRDI portal
Publication:5897220
DOI10.1007/b13743zbMath1273.90176OpenAlexW2497660909MaRDI 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
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
A review on algorithms for maximum clique problems, A logical approach to efficient Max-SAT solving, On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem, An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem, Some spin glass ideas applied to the clique problem, Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms, A Max-SAT Inference-Based Pre-processing for Max-Clique, Local search with edge weighting and configuration checking heuristics for minimum vertex cover, Incremental Upper Bound for the Maximum Clique Problem, Weighted matching as a generic pruning technique applied to optimization constraints, Exact algorithms for maximum clique: a computational study, A New Approach to the Stable Set Problem Based on Ellipsoids, Finding quasi core with simulated stacked neural networks, Global propagation of side constraints for solving over-constrained problems, Exploiting semidefinite relaxations in constraint programming
Uses Software
