Partition-based lower bound for Max-CSP

DOI10.1023/A:1020510611031zbMath1028.68156MaRDI QIDQ1871975

Javier Larrosa, Pedro Meseguer

Publication date: 4 May 2003

Published in: Constraints (Search for Journal in Brave)

zbMATH Keywords

branch and boundconstraint optimizationMax-CSP

Mathematics Subject Classification ID

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

Related Items (3)

Maximum feasibility estimation ⋮ Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories ⋮ Exact Max-SAT solvers for over-constrained problems

This page was built for publication: Partition-based lower bound for Max-CSP