Maintaining reversible DAC for Max-CSP

DOI10.1016/S0004-3702(98)00108-8zbMath0911.68064OpenAlexW2076921757MaRDI QIDQ1277774

Pedro Meseguer, Javier Larrosa, Thomas Schiex

Publication date: 2 March 1999

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(98)00108-8

zbMATH Keywords

branch and bounddirected arc-consistencymaximal/partial constraint satisfactionpartial forward checking

Mathematics Subject Classification ID

Knowledge representation (68T30) Parallel algorithms in computer science (68W10)

Related Items (10)

On Inconsistent Clause-Subsets for Max-SAT Solving ⋮ Combining VNS with constraint programming for solving anytime optimization problems ⋮ The complexity of soft constraint satisfaction ⋮ Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories ⋮ On-line resources allocation for ATM networks with rerouting ⋮ Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP ⋮ Clique inference process for solving Max-CSP ⋮ Arc consistency for soft constraints ⋮ Cyclic consistency: A local reduction operation for binary valued constraints ⋮ Solving weighted CSP by maintaining arc consistency

Cites Work

• Network-based heuristics for constraint-satisfaction problems
• Radio link frequency assignment

This page was built for publication: Maintaining reversible DAC for Max-CSP