Inter-block Backtracking: Exploiting the Structure in Continuous CSPs

DOI10.1007/11425076_2MaRDI QIDQ5450794zbMATH OpenOpenAlexFDO

Authors Bertrand Neveu, Christophe Jermann, Gilles Trombettoni

Publication date 14 March 2008

Published in Global Optimization and Constraint Satisfaction (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11425076_2

zbMATH Keywords

backtrackingdecompositionintervalssolving sparse systems

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Principles and Practice of Constraint Programming – CP 2004
• Some new tractable classes of CSPs and their relations with backtracking algorithms
• BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
• When Interval Analysis Helps Inter-block Backtracking
• Backjump-based backtracking for constraint satisfaction problems
• scientific article; zbMATH DE number 1059313
• Structural tractability of enumerating CSP solutions
• scientific article; zbMATH DE number 3924508

Cited in

(3)

• Improving inter-block backtracking with interval Newton
• When Interval Analysis Helps Inter-block Backtracking
• scientific article; zbMATH DE number 1059313 (Why is no real title available?)

Describes a project that uses

Uses Software

• GPDOF

This page was built for publication: Inter-block Backtracking: Exploiting the Structure in Continuous CSPs

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