Global Optimization on Type U various geometries synthetic
0.14Time (s)Algorithm 1
Evaluation Results
| Method | Links | |
|---|---|---|
| Algorithm 1n=10, lx, ly=2,2, Rel. error=10^-8, Strategy=Extreme point2023.07 | 0.14 | |
| (6) B&Bn=10, lx, ly=2,2, Rel. error=10^-82023.07 | 0.15 | |
| Algorithm 1n=100, lx, ly=2,2, Rel. error=10^-8, Strategy=Extreme point2023.07 | 0.48 | |
| Algorithm 1n=10, lx, ly=2,3, Rel. error=10^-8, Strategy=Extreme point2023.07 | 1.8 | |
| (6) B&Bn=10, lx, ly=2,3, Rel. error=10^-82023.07 | 2.4 | |
| Algorithm 1n=500, lx, ly=2,2, Rel. error=10^-8, Strategy=Extreme point2023.07 | 11 | |
| Algorithm 1n=10, lx, ly=2,2, Rel. error=10^-8, Strategy=B&B2023.07 | 21 | |
| (6) B&Bn=100, lx, ly=2,2, Rel. error=10^-82023.07 | 25 | |
| MILP1n=10, lx, ly=2,2, Rel. error=10^-82023.07 | 39 | |
| Algorithm 1n=1000, lx, ly=2,2, Rel. error=10^-8, Strategy=Extreme point2023.07 | 69 | |
| Algorithm 1n=100, lx, ly=2,2, Rel. error=10^-8, Strategy=B&B2023.07 | 86 | |
| MILP1n=10, lx, ly=2,3, Rel. error=10^-82023.07 | 105 | |
| Algorithm 1n=10, lx, ly=2,3, Rel. error=10^-8, Strategy=B&B2023.07 | 133 | |
| (6) B&Bn=100, lx, ly=2,3, Rel. error=10^-82023.07 | 172 | |
| Algorithm 1n=100, lx, ly=2,3, Rel. error=10^-8, Strategy=Extreme point2023.07 | 278 | |
| Algorithm 1n=500, lx, ly=2,2, Rel. error=10^-8, Strategy=B&B2023.07 | 408 | |
| Algorithm 1n=2000, lx, ly=2,2, Rel. error=10^-8, Strategy=Extreme point2023.07 | 460 | |
| Algorithm 1n=1000, lx, ly=2,2, Rel. error=10^-8, Strategy=B&B2023.07 | 576 | |
| Algorithm 1n=500, lx, ly=2,3, Rel. error=10^-8, Strategy=Extreme point2023.07 | 9,568 |