scientific article; zbMATH DE number 5205088
From MaRDI portal
Publication:5421933
zbMath1274.65184MaRDI QIDQ5421933
Publication date: 25 October 2007
Full work available at URL: http://www.jucs.org/jucs_8_11/extentions_of_affine_arithmetic
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Numerical optimization and variational techniques (65K10) Interval and finite arithmetic (65G30)
Related Items
Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ Numerical certification of Pareto optimality for biobjective nonlinear problems ⋮ 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 ⋮ raSAT: an SMT solver for polynomial constraints ⋮ Adaptive constructive interval disjunction: algorithms and experiments ⋮ Improved convex and concave relaxations of composite bilinear forms ⋮ The small octagons of maximal width ⋮ Deterministic global optimization using interval constraint propagation techniques ⋮ A reliable affine relaxation method for global optimization ⋮ A general reliable quadratic form: An extension of affine arithmetic ⋮ A Comparison of Methods for Solving Parametric Interval Linear Systems with General Dependencies ⋮ On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic ⋮ raSAT: An SMT Solver for Polynomial Constraints ⋮ An interval inverse method based on high dimensional model representation and affine arithmetic ⋮ Enhancing numerical constraint propagation using multiple inclusion representations ⋮ Empirical investigation of the convergence speed of inclusion functions in a global otimization context ⋮ Certification of real inequalities: templates and sums of squares
This page was built for publication:
