On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
Branch and Bound (B&B) algorithms in Global Optimization are used to perform an exhaustive search over the feasible area. One choice is to use simplicial partition sets. Obtaining sharp and cheap bounds of the objective function over a simplex is very important in the construction of efficient G...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2021
|
| Sorozat: | JOURNAL OF GLOBAL OPTIMIZATION
80 No. 4 |
| Tárgyszavak: | |
| doi: | 10.1007/s10898-021-01053-8 |
| mtmt: | 32161525 |
| Online Access: | http://publicatio.bibl.u-szeged.hu/36409 |