Pages that link to "Item:Q968347"

The following pages link to A new framework for sharp and efficient resolution of NCSP with manifolds of solutions (Q968347):

Displaying 9 items.

• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
• Interval-based projection method for under-constrained numerical systems (Q487645) (← links)
• On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach (Q905750) (← links)
• A new framework for sharp and efficient resolution of NCSP with manifolds of solutions (Q968347) (← links)
• Exclusion regions for parameter-dependent systems of equations (Q2052383) (← links)
• First order rejection tests for multiple-objective optimization (Q2250111) (← links)
• The octagon abstract domain for continuous constraints (Q2342596) (← links)
• A branch and prune algorithm for the computation of generalized aspects of parallel robots (Q2453696) (← links)
• Estimating the robust domain of attraction for difference inclusions using an interval Lyapunov equation (Q6648477) (← links)