Research Article

A Branch-and-Bound Algorithm Embedded with DCA for DC Programming

Table 1

Computational results with the B&B, B&B-DCA and DCA, methods.

Dim  B&B   B&B-DCADCA
Avg Bran Time(s) Avg Bran Time(s) Num DCA Time(s) Num Glob

𝑛 = 5 0 56.4 7.15 47.6 6.29 1 0.46 5
𝑛 = 1 0 0 195.8 40.70 145.4 30.10 1 0.58 5
𝑛 = 1 5 0 30983.00 174.2 47.35 1 0.70 5
𝑛 = 2 0 0 327.6 182.95 310.2 174.28 1 1.26 5
𝑛 = 2 5 0 486.4 382.98 399.6 315.46 1 2.02 5
𝑛 = 3 0 0 428.2 422.59 341.2 333.98 1 2.09 5
𝑛 = 3 5 0 951.8 1231.52 756 969.82 1.2 3.51 4
𝑛 = 4 0 0 988 1753.09 666.6 1183.18 1.2 4.28 4