scientific article; zbMATH DE number 1543292

zbMath1063.90574MaRDI QIDQ4520756

Frédéric Messine, Jean-Louis Lagouanelle

Publication date: 27 February 2001

Full work available at URL: http://www.jucs.org/jucs_4_6/enclosure_methods_for_multivariate

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Related Items (15)

The small octagon with longest perimeter ⋮ On interval branch-and-bound for additively separable functions with common variables ⋮ Constrained global optimization for wine blending ⋮ Efficiency of a Global Optimization Algorithm ⋮ Adaptive constructive interval disjunction: algorithms and experiments ⋮ A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms ⋮ Deterministic global optimization using interval constraint propagation techniques ⋮ Upper bounding in inner regions for global optimization under inequality constraints ⋮ Extremal problems for convex polygons ⋮ A general reliable quadratic form: An extension of affine arithmetic ⋮ Comparison between Baumann and admissible simplex forms in interval analysis ⋮ Node selection strategies in interval branch and bound algorithms ⋮ On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic ⋮ Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint ⋮ A new inclusion function for optimization: kite -- the one-dimensional case

This page was built for publication: