An Approximation Algorithm for the Facility Location Problem with Lexicographic Minimax Objective

Table 2

Computational results for the algorithm A-LEX: medium instances.

Instance	|𝐼|	𝑝	𝑘max	O-LEX		A-LEX^𝑋
				Time [s]	𝑘𝑠	Time [s]	𝑘𝑠	Δ
𝑆𝐽𝐶2	200	10	426	131.4	238	50.9	237	0
𝑆𝐽𝐶2	200	20	306	64.4	132	37.4	128	0
𝑆𝐽𝐶2	200	30	218	32.2	79	17.4	71	0
𝑆𝐽𝐶2	200	40	169	20.3	39	9.7	40	0
𝑆𝐽𝐶3	300	15	445	461.6	207	357.7	189	0
𝑆𝐽𝐶3	300	30	267	145.1	70	68.8	58	0
𝑆𝐽𝐶3	300	45	226	71.1	46	37.9	41	0
𝑆𝐽𝐶3	300	60	215	53.3	50	29.8	42	0
𝑆𝐽𝐶4	402	20	461	1371.2	161	1205.8	140	0
𝑆𝐽𝐶4	402	40	342	1207.5	74	1052.5	58	0
𝑆𝐽𝐶4	402	60	229	158.7	33	87.2	29	0
𝑆𝐽𝐶4	402	80	193	144.9	25	56.2	24	0
𝑆𝑝𝑎𝑖𝑛_737_1	737	37	467	116838.0	92	81185.1	65	0
𝑆𝑝𝑎𝑖𝑛_737_1	737	50	348	196000.0	53	27296.2	49	0
𝑆𝑝𝑎𝑖𝑛_737_1	737	185	108	12367.4	5	279.5	5	0
𝑆𝑝𝑎𝑖𝑛_737_1	737	259	59	430.4	2	32.2	2	0
𝑆𝑝𝑎𝑖𝑛_737_2	737	37	467	35590.7	88	29185.6	65	0
𝑆𝑝𝑎𝑖𝑛_737_2	737	50	348	64005.7	59	27806.1	38	0
𝑆𝑝𝑎𝑖𝑛_737_2	737	185	108	3182.3	5	232.4	5	0
𝑆𝑝𝑎𝑖𝑛_737_2	737	259	59	72.5	1	43.2	1	2