Cited in
(80)- Localizer: A Modeling Language for Local Search
- Contracting optimally an interval matrix without loosing any positive semi-definite matrix is a tractable problem
- Exclusion regions for optimization problems
- Validated constraints solving --- practicalities, pitfalls, and new developments
- Solving kinematics problems by efficient interval partitioning
- Simulation of discrete linear time-invariant fuzzy dynamic systems
- On verified numerical computations in convex programming
- Constraint and integer programming in OPL
- Termination of floating-point computations
- A certified branch \& bound approach for reliability-based optimization problems
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
- Some observations on exclusion regions in branch and bound algorithms
- An analysis of arithmetic constraints on integer intervals
- scientific article; zbMATH DE number 2084729 (Why is no real title available?)
- Node selection strategies in interval branch and bound algorithms
- Formulation for reliable analysis of structural frames
- Safe and tight linear estimators for global optimization
- An interval component for continuous constraints.
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Consistency techniques in ordinary differential equations
- Design, implementation, and evaluation of the constraint language cc(FD)
- Constraint propagation on quadratic constraints
- Integrating finite domain and set constraints into a set-based constraint language
- Interval-based projection method for under-constrained numerical systems
- A reliable affine relaxation method for global optimization
- A Constraint Satisfaction Approach for Enclosing Solutions to Parametric Ordinary Differential Equations
- CLPS-B
- GLOPT
- INTBIS
- PROFIL/BIAS
- CLAIRE
- GPDOF
- SALSA
- CHIP
- ICOS
- RealPaver
- CFSQP
- INTOPT_90
- COCONUT
- COPRIN
- ALIAS
- TADIFF
- gaol
- GlobSol
- AQCS
- Lurupa
- coco_gop_ex
- PSICO
- IBEX
- IbexOpt
- cc(FD)
- Localizer
- MSLAM
- Newton
- OPL
- CBack
- IQCP/MIQCP
- JSetL
- DynIbex
- Improving inter-block backtracking with interval Newton
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- USAC
- Contractor programming
- Interval computations, rigour and non-rigour in deterministic continuous global optimization
- Localizer
- Accelerating filtering techniques for numeric CSPs
- Local consistency for extended CSPs
- Adaptive constructive interval disjunction: algorithms and experiments
- CPBPV: a constraint-programming framework for bounded program verification
- Computing the pessimism of inclusion functions
- Range-only SLAM with indistinguishable landmarks; a constraint programming approach
- Thick set inversion
- A rigorous global filtering algorithm for quadratic constraints
- Domain reduction techniques for global NLP and MINLP optimization
- A generic interval branch and bound algorithm for parameter estimation
- A microkernel architecture for constraint programming
- Set-membership state estimation with fleeting data
- Actions of the hyperoctahedral group to compute minimal contractors
This page was built for software: Numerica
