On derivative based bounding for simplicial branch and bound
Simplicial based Global Optimization branch and bound methods require tight bounds on the objective function value. Recently, a renewed interest appears on bound calculation based on Interval Arithmetic by Karhbet and Kearfott [Reliable Comput. 25 (2017) 53-73] and on exploiting second derivative bo...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2021
|
| Sorozat: | RAIRO-OPERATIONS RESEARCH
55 No. 3 |
| Tárgyszavak: | |
| doi: | 10.1051/ro/2021081 |
| mtmt: | 32114797 |
| Online Access: | http://publicatio.bibl.u-szeged.hu/36648 |