MIPLIB 2003

instance can be solved within an hour with a commercial solver
instance has been solved
optimal solution to instance is unknown

Status	Name	C	Rows	Cols	NZ	Int	Bin	Con	Objective	1	2	3	4	5	6	7	8	9	10	11	12	13
	10teams	M	230	2025	12150		1800	225	924	X	X										X
	a1c1s1	M	3312	3648	10178		192	3456	11503.4											X	X
	aflow30a	M	479	842	2091		421	421	1158	X			X							X	X
	aflow40b	M	1442	2728	6783		1364	1364	1168	X			X							X	X
	air04	B	823	8904	72965		8904		56137	X
	air05	B	426	7195	52121		7195		26374	X
	arki001	M	1048	1388	20439	123	415	850	7.58081e+06		X					X	X	X			X	X
	atlanta-ip	M	21732	48738	257532	106	46667	1965	90.0099	X	X	X	X			X	X	X		X	X
	cap6000	B	2176	6000	48243		6000		-2.45138e+06	X	X					X	X
	dano3mip	M	3202	13873	79655		552	13321	?				X						X	X	X
	danoint	M	664	521	3232		56	465	65.6667				X							X	X
	disctom	B	399	10000	30000		10000		-5000	X			X
	ds	B	656	67732	1024059		67732		93.52	X
	fast0507	B	507	63009	409349		63009		174		X	X
	fiber	M	363	1298	2944		1254	44	405935	X			X								X
	fixnet6	M	478	878	1756		378	500	3983											X	X
	gesa2	M	1392	1224	5064	168	240	816	2.57799e+07		X							X	X	X	X	X
	gesa2-o	M	1248	1224	3672	336	384	504	2.57799e+07		X	X						X	X	X	X	X
	glass4	M	396	322	1815		302	20	1.20001e+09	X											X
	harp2	B	112	2993	5840		2993		-7.38998e+07	X					X		X
	liu	M	2178	1156	10626		1089	67	?												X
	manna81	I	6480	3321	12960	3303	18		-13164									X
	markshare1	M	6	62	312		50	12	1												X
	markshare2	M	7	74	434		60	14	1												X
	mas74	M	13	151	1706		150	1	11801.2							X					X
	mas76	M	12	151	1640		150	1	40005.1							X					X
	misc07	M	212	260	8619		259	1	2810	X	X	X	X		X	X					X
	mkc	M	3411	5325	17038		5323	2	-563.846		X				X	X					X
	mod011	M	4480	10958	22254		96	10862	-5.45585e+07											X	X
	modglob	M	291	422	968		98	324	2.07405e+07											X	X
	momentum1	M	42680	5174	103198		2349	2825	109143	X	X					X			X	X	X
	momentum2	M	24237	3732	349695	1	1808	1923	12314.2	X	X	X			X	X		X	X	X	X
	momentum3	M	56822	13532	949495	1	6598	6933	?	X	X				X	X		X	X	X	X
	msc98-ip	M	15850	21143	92918	53	20237	853	1.98395e+07	X	X	X	X			X	X	X		X	X
	mzzv11	I	9499	10240	134603	251	9989		-21718	X	X	X	X			X	X	X				X
	mzzv42z	I	10460	11717	151261	235	11482		-20540	X	X		X					X				X
	net12	M	14021	14115	80384		1603	12512	214	X	X	X	X			X					X
	noswot	M	182	128	735	25	75	28	-41									X		X		X
	nsrand-ipx	M	735	6621	223261		6620	1	51200		X						X				X
	nw04	B	36	87482	636666		87482		16862	X
	opt1217	M	64	769	1542		768	1	-16	X											X
	p2756	B	755	2756	8937		2756		3124		X				X		X
	pk1	M	45	86	915		55	31	11												X
	pp08aCUTS	M	246	240	839		64	176	7350											X	X
	pp08a	M	136	240	480		64	176	7350											X	X
	protfold	B	2112	1835	23491		1835		-31	X	X	X	X			X
	qiu	M	1192	840	3432		48	792	-132.873											X	X
	rd-rplusc-21	M	125899	622	852384		457	165	165395	X											X
	roll3000	M	2295	1166	29386	492	246	428	12890		X	X			X			X			X	X
	rout	M	291	556	2431	15	300	241	1077.56		X							X		X		X
	set1ch	M	492	712	1412		240	472	54537.8											X	X
	seymour	B	4944	1372	33549		1372		423		X	X
	sp97ar	B	1761	14101	290968		14101		6.60706e+08		X	X					X
	stp3d	B	159488	204880	662128		204880		493.72	X	X		X
	swath	M	884	6805	34965		6724	81	467.407	X			X								X
	t1717	B	551	73885	325689		73885		?	X
	timtab1	M	171	397	829	107	64	226	764772												X	X
	timtab2	M	294	675	1482	181	113	381	1.09656e+06												X	X
	tr12-30	M	750	1080	2508		360	720	130596											X	X
	vpm2	M	234	378	917		168	210	13.75											X	X

1. Set Partion Σxi=1, xi binary
2. Set Packing Σxi≤1, xi binary
3. Set Cover Σxi≥1, xi binary
4. Cardinality Σxi=b, xi binary, b∈N
5. Equality Knapsack Σ ai xi=b, xi binary, ai,b∈N
6. Bin Packing Σ ai xi+ ak xk≤ ak, xi binary, ai,ak∈N
7. Invariant Knapsack Σ xi≤b, xi binary, b∈N
8. Knapsack Σ ai xi≤b, xi binary, ai,b∈N
9. Integer Knapsack Σ ai yi≤b, yi≥0 integer, ai,b∈N
10. Variable Lower Bound ak xk≤sk, xk binary, sk continuous or integer, ak∈R
11. Variable Upper Bound ak xk≥sk, xk binary, sk continuous or integer, ak∈R
12. Mixed Binary Σ ai xi+ Σ pj sj ≤ or = b, xi binary, sj continuous, ai, pj∈R
13. General: anything else

Note: to match the definitions of the constraint types, the following transformations may be applied: scaling with arbitrary non-zero values, negating of binary variables, and shifting of integer variables with finite bounds.