A polynomial algorithm for continuous non-binary disjunctive CSPs

MaRDI QIDQ4811607zbMATH OpenFDO

Authors Miguel A. Salido, Federico Barber

Publication date 6 September 2004

zbMATH Keywords

Constraint Satisfaction Problems

Mathematics Subject Classification ID

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

Recommendations

• Disjunction of non-binary and numeric constraint satisfaction problems
• An incremental and non-binary CSP solver: The hyperpolyhedron search algorithm
• scientific article; zbMATH DE number 1213132
• Constraint satisfaction -- algorithms and complexity analysis
• scientific article; zbMATH DE number 1420797

Cited in

(2)

• Disjunction of non-binary and numeric constraint satisfaction problems
• An incremental and non-binary CSP solver: The hyperpolyhedron search algorithm

This page was built for publication: A polynomial algorithm for continuous non-binary disjunctive CSPs

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