Improving interval analysis bounds by translations
From MaRDI portal
Publication:1888143
DOI10.1023/B:JOGO.0000042114.11969.bbzbMath1116.90388MaRDI QIDQ1888143
Emilio Carrizosa, Pierre Hansen, Frédéric Messine
Publication date: 22 November 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (4)
Global optimization with spline constraints: a new branch-and-bound method based on B-splines ⋮ Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ (Global) optimization: historical notes and recent developments ⋮ Comparison between Baumann and admissible simplex forms in interval analysis
Uses Software
This page was built for publication: Improving interval analysis bounds by translations
