Publication:5421933
From MaRDI portal
zbMath1274.65184MaRDI QIDQ5421933
Publication date: 25 October 2007
Full work available at URL: http://www.jucs.org/jucs_8_11/extentions_of_affine_arithmetic
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
65K10: Numerical optimization and variational techniques
65G30: Interval and finite arithmetic
Related Items
Deterministic global optimization using interval constraint propagation techniques, Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, A reliable affine relaxation method for global optimization, Empirical convergence speed of inclusion functions for facility location problems, Solving a huff-like competitive location and design model for profit maximization in the plane, Adaptive constructive interval disjunction: algorithms and experiments, Enhancing numerical constraint propagation using multiple inclusion representations, raSAT: an SMT solver for polynomial constraints, The small octagons of maximal width, On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic, An interval inverse method based on high dimensional model representation and affine arithmetic, Certification of real inequalities: templates and sums of squares, A general reliable quadratic form: An extension of affine arithmetic, Empirical investigation of the convergence speed of inclusion functions in a global otimization context, raSAT: An SMT Solver for Polynomial Constraints, A Comparison of Methods for Solving Parametric Interval Linear Systems with General Dependencies
