Maintaining reversible DAC for Max-CSP

DOI10.1016/S0004-3702(98)00108-8MaRDI QIDQ1277774zbMATH OpenOpenAlexFDO

Authors Javier Larrosa, P. Meseguer, 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)

Recommendations

• Partition-based lower bound for Max-CSP
• scientific article; zbMATH DE number 2088040
• Solving weighted CSP by maintaining arc consistency
• New algorithms for max restricted path consistency
• Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP

Cites work

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

Cited in

(12)

• New algorithms for max restricted path consistency
• On-line resources allocation for ATM networks with rerouting
• Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
• Arc consistency for soft constraints
• Solving weighted CSP by maintaining arc consistency
• 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
• Clique inference process for solving Max-CSP
• On Inconsistent Clause-Subsets for Max-SAT Solving
• Cyclic consistency: A local reduction operation for binary valued constraints
• Partition-based lower bound for Max-CSP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1277774)