Numerica
From MaRDI portal
Software:33038
No author found.
Related Items (46)
Constraint and Integer Programming in OPL ⋮ A Constraint Satisfaction Approach for Enclosing Solutions to Parametric Ordinary Differential Equations ⋮ Simulation of discrete linear time-invariant fuzzy dynamic systems ⋮ Contractor programming ⋮ Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ On verified numerical computations in convex programming ⋮ Termination of floating-point computations ⋮ Range-only SLAM with indistinguishable landmarks; a constraint programming approach ⋮ Formulation for reliable analysis of structural frames ⋮ Constraint propagation on quadratic constraints ⋮ Thick set inversion ⋮ Localizer ⋮ A certified branch \& bound approach for reliability-based optimization problems ⋮ A generic interval branch and bound algorithm for parameter estimation ⋮ Set-membership state estimation with fleeting data ⋮ Adaptive constructive interval disjunction: algorithms and experiments ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Unnamed Item ⋮ A microkernel architecture for constraint programming ⋮ An interval component for continuous constraints. ⋮ Solving kinematics problems by efficient interval partitioning ⋮ Interval-based projection method for under-constrained numerical systems ⋮ Efficient interval partitioning-local search collaboration for constraint satisfaction ⋮ An analysis of arithmetic constraints on integer intervals ⋮ A reliable affine relaxation method for global optimization ⋮ Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization ⋮ Exclusion regions for optimization problems ⋮ Computing the pessimism of inclusion functions ⋮ Contracting optimally an interval matrix without loosing any positive semi-definite matrix is a tractable problem ⋮ CPBPV: a constraint-programming framework for bounded program verification ⋮ Improving inter-block backtracking with interval Newton ⋮ Safe and tight linear estimators for global optimization ⋮ A rigorous global filtering algorithm for quadratic constraints ⋮ A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Localizer: A Modeling Language for Local Search ⋮ Node selection strategies in interval branch and bound algorithms ⋮ Interval computations, rigour and non-rigour in deterministic continuous global optimization ⋮ Integrating Finite Domain and Set Constraints into a Set-based Constraint Language ⋮ Local consistency for extended CSPs ⋮ Validated constraints solving --- practicalities, pitfalls, and new developments ⋮ Actions of the hyperoctahedral group to compute minimal contractors ⋮ Some observations on exclusion regions in branch and bound algorithms ⋮ Accelerating filtering techniques for numeric CSPs ⋮ Design, implementation, and evaluation of the constraint language cc(FD) ⋮ Consistency techniques in ordinary differential equations
This page was built for software: Numerica
