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...
Saved in:
| 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
-
THE SIMPLEX - PREEMPTIVE GOAL PROGRAMMING WITH BRANCH AND BOUND METHOD FOR OPTIMIZING WASTE VEHICLE ROUTES AND TRANSPORTATION
by: Rifa Fadhila, et al.
Published: (2024-07-01) -
Upper bounds of differential branch number of $$n$$ n -bit permutations
by: Ying Gao, et al.
Published: (2025-05-01) -
Algorithm and software for the optimal technological design of a system of simple distillation columns
by: N. N. Ziyatdinov, et al.
Published: (2021-11-01) -
Verification of Backtracking and Branch and Bound Design Templates
by: N. V. Shilov
Published: (2011-12-01) -
Interval sets in applied geometry
by: V. Yu. Yurkov
Published: (2024-11-01)