Constraint-Level Advice for Shaving

DOI10.1007/978-3-540-89982-2_52MaRDI QIDQ5504686zbMATHOpenAlexFDO

Authors Radoslaw Szymanek, Christophe Lecoutre

Publication date 22 January 2009

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89982-2_52

Mathematics Subject Classification ID

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

Recommendations

• When is it worthwhile to propagate a constraint? A probabilistic analysis of \textsc{AllDifferent}
• Constraint propagation techniques for the disjunctive scheduling problem
• Removing propagation redundant constraints in redundant modeling
• Improving linear constraint propagation by changing constraint representation
• The complexity of reasoning with global constraints

Cites work

• 2 -Way vs.d -Way Branching for CSP
• Acquiring Parameters of Implied Global Constraints
• Adjustment of heads and tails for the job-shop problem
• Combination of Among and Cardinality Constraints
• Domain filtering consistencies
• Domain filtering consistencies for non-binary constraints

Cited in

(1)

• Optimal Groomings with Grooming Ratios Six and Seven

Describes a project that uses

Uses Software

• JaCoP

This page was built for publication: Constraint-Level Advice for Shaving

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