Valid Inequality Based Lower Bounds for WCSP

DOI10.1007/978-3-540-74970-7_29MaRDI QIDQ3523069zbMATH OpenOpenAlexFDO

Authors Mohand Ou Idir Khemmoudj, Hachemi Bennaceur

Publication date 2 September 2008

Published in Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74970-7_29

Mathematics Subject Classification ID

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

Recommendations

• Soft arc consistency revisited
• Solving weighted CSP by maintaining arc consistency
• Bounds arc consistency for weighted CSPs
• scientific article; zbMATH DE number 2080322
• Arc consistency for soft constraints

Cites work

• Clique Inference Process for Solving Max-CSP
• scientific article; zbMATH DE number 2080322 (Why is no real title available?)
• Radio link frequency assignment

Cited in

(1)

• Bounds arc consistency for weighted CSPs

This page was built for publication: Valid Inequality Based Lower Bounds for WCSP

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