Efficient use of optimality conditions in Interval Branch and Bound methods

The Interval Branch and Bound (IBB) method is a widely used approach for solving nonlinear programming problems where a rigorous solution is required. The method uses Interval Arithmetic (IA) to handle rounding errors in calculations. In the literature, a wide range of variations of IBB exists. Howe...

Full description

Saved in:
Bibliographic Details
Main Authors: Mihály Gencsi, Boglárka G.-Tóth
Format: Article
Language:English
Published: Elsevier 2025-01-01
Series:EURO Journal on Computational Optimization
Subjects:
Online Access:http://www.sciencedirect.com/science/article/pii/S219244062500005X
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items