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

Table 3

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

Instance	|𝐼|	𝑝	𝑘max	A-LEX^𝑍
				Time [s]	𝑘𝑠
𝑝3038	3038	2500	33	2520.8	1
𝑝3038	3038	2000	35	4204.3	2
𝑝3038	3038	1500	38	8915.9	2
𝑝3038	3038	900	73	190092.9	7
𝑝3038	3038	700	110	17902.9	8
𝑝3038	3038	100	*	*	*
𝑝3038	3038	50	*	*	*
𝑝3038	3038	10	1188	201165.3	36
𝑆𝑅	2928	2500	3	786.8	0
𝑆𝑅	2928	2000	4	1021.6	0
𝑆𝑅	2928	1500	5	1083.4	0
𝑆𝑅	2928	1000	8	1622.9	0
𝑆𝑅	2928	900	9	1988.5	0
𝑆𝑅	2928	700	11	2954.2	0
𝑆𝑅	2928	100	48	9624.7	0
𝑆𝑅	2928	50	65	10509.8	0
𝑆𝑅	2928	10	92	11888.4	0
𝑈𝑆	2398	2000	10	1006.6	0
𝑈𝑆	2398	1500	15	1203.7	0
𝑈𝑆	2398	1000	22	1702.7	0
𝑈𝑆	2398	900	25	1694.7	0
𝑈𝑆	2398	700	33	11022.5	0
𝑈𝑆	2398	100	*	*	*
𝑈𝑆	2398	50	*	*	*
𝑈𝑆	2398	10	219	9038.2	0

Table cells filled with the symbol “*” indicate the instances when the algorithm did not terminate within 3 days.