Certificates of Optimality for Mixed Integer Linear Programming Using Generalized Subadditive Generator Functions

Table 5

Set covering problems.

Problem name	Number of variables		Ratio	MILP time (ms)	Certificate time (ms)
scp1.mps	10	3	0.3
scp2.mps	20	5	0.25
scp3.mps	30	20	0.66
scp4.mps	40	8	0.2
scp5.mps	50	25	0.5
scp6.mps	60	7	0.11
scp7.mps	70	17	0.24
scp8.mps	80	45	0.56
scp9.mps	90	51	0.56
scp10.mps	100	60	0.6
scp11.mps	110	84	0.7
scp12.mps	150	43	0.28
scp13.mps	200	94	0.47
scp14.mps	250	17	0.06	70	10
scp15.mps	300	7	0.02	80	20
scp16.mps	500	12	0.02	120	30
scp17.mps	750	339	0.45	240	70