Table 4 Performance of the three methods ((\(\theta , \eta , \beta , P, T_0) =\) (5, 50, 100, 6, 6)).

From: Distributionally robust optimization for fire station location under uncertainties

Instance (|I|, |J|)

Heuristic method (lower bound)

Cutting plane (exact solution)

Approximation by LDRs (upper bound)

(10, 8)

1835.14 (0.2 s)

1835.14 (22.57 s)

1835.14 (3.5 s)

(20, 15)

2749.75 (2.16 s)

2596.73 (1 h)

2749.75 (65.36 s)

(30, 20)

3420.79 (8.61 s)

3091.09 (1 h)

3420.79 (412.2 s)

(100. 80)

7701.38 (118.21 s)

6947.53 (1 h)

7935.22 (1 h)