Instance - qnet1


	Raw This is the CCM image before the decomposition procedure has been applied.	Decomposed This is the CCM image after a decomposition procedure has been applied. This is the image used by the MIC's image-based comparisons for this query instance.	Composite of MIC Top 5 Composite of the five decomposed CCM images from the MIC Top 5.	Composite of MIPLIB Top 5 Composite of the five decomposed CCM images from the MIPLIB Top 5.	Model Group Composite Image Composite of the decomposed CCM images for every instance in the same model group as this query.

Decomposed These decomposed images were created by GCG.
Name	f2gap40400 [MIPLIB]	bppc8-02 [MIPLIB]	ponderthis0517-inf [MIPLIB]	gen-ip054 [MIPLIB]	gen-ip002 [MIPLIB]
Rank / ISS The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query instance and all other instances. A smaller ISS value indicates greater similarity.	1 / 1.014	2 / 1.075	3 / 1.082	4 / 1.114	5 / 1.123
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.

Decomposed These decomposed images were created by GCG.
Name	qnet1 [MIPLIB]	rococoC11-010100 [MIPLIB]	rococoB10-011000 [MIPLIB]	rococoC11-011100 [MIPLIB]	rococoC10-001000 [MIPLIB]
Rank / ISS The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query instance and all model groups. A smaller ISS value indicates greater similarity.	214 / 1.489	856 / 1.873	894 / 2.016	895 / 2.017	897 / 2.025
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.

Instance Summary

The table below contains summary information for qnet1_o, the five most similar instances to qnet1_o according to the MIC, and the five most similar instances to qnet1_o according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	qnet1_o [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	0.000000	-
MIC Top 5	f2gap40400 [MIPLIB]	Salim Haddadi	Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600)	1.014199	1
	bppc8-02 [MIPLIB]	Manuel Iori	The models that we attach solve the "bar-relaxation", also known as the "Bin Packing Problem with Contiguity" or the "P\|\|Cmax with contiguity". This is one of the most interesting relaxations for two dimensional cutting and packing problems. Its solution by means of an ILP software is the bottleneck of the primal decomposition methods that we attempted in the paper cited below. In detail, the files correspond to model (12)-(15) in the paper, applied to the instances of the Classes 4, 6 and 8 by Martello and Vigo (Management Science, 1998).	1.075381	2
	ponderthis0517-inf [MIPLIB]	Rob Pratt	Infeasible version of IBM Ponder This problem (with 52 characters and no spaces) from May 2017: https://www.research.ibm.com/haifa/ponderthis/challenges/May2017.html	1.082006	3
	gen-ip054 [MIPLIB]	Simon Bowly	Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms.	1.113680	4
	gen-ip002 [MIPLIB]	Simon Bowly	Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms.	1.123351	5
MIPLIB Top 5	qnet1 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.488987	214
	rococoC11-010100 [MIPLIB]	A. Chabrier, E. Danna, C. Le Pape, L. Perron	Model for dimensioning the arc capacities in a telecommunication network.	1.873255	856
	rococoB10-011000 [MIPLIB]	A. Chabrier, E. Danna, C. Le Pape, L. Perron	Model for dimensioning the arc capacities in a telecommunication network	2.016264	894
	rococoC11-011100 [MIPLIB]	A. Chabrier, E. Danna, C. Le Pape, L. Perron	Model for dimensioning the arc capacities in a telecommunication network. Solved by Gurobi 4.5.1 (4 threads) in 66892.47 seconds.	2.016775	895
	rococoC10-001000 [MIPLIB]	A. Chabrier, E. Danna, C. Le Pape, L. Perron	Model for dimensioning the arc capacities in a telecommunication network	2.025199	897

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	neos-pseudoapplication-21	timtab	scp	neos-pseudoapplication-40	enlight
Rank / ISS The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query instance and all other instances. A smaller ISS value indicates greater similarity.	1 / 1.522	2 / 1.528	3 / 1.542	4 / 1.654	5 / 1.659

Model Group Summary

The table below contains summary information for the five most similar model groups to qnet1_o according to the MIC.

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	neos-pseudoapplication-21	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.521633	1
	timtab	C. Liebchen, R. Möhring	Public transport scheduling problem	1.528120	2
	scp	Shunji Umetani	This is a random test model generator for SCP using the scheme of the following paper, namely the column cost c[j] are integer randomly generated from [1,100]; every column covers at least one row; and every row is covered by at least two columns. see reference: E. Balas and A. Ho, Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study, Mathematical Programming, 12 (1980), 37-60. We have newly generated Classes I-N with the following parameter values, where each class has five models. We have also generated reduced models by a standard pricing method in the following paper: S. Umetani and M. Yagiura, Relaxation heuristics for the set covering problem, Journal of the Operations Research Society of Japan, 50 (2007), 350-375. You can obtain the model generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark	1.541657	3
	neos-pseudoapplication-40	Jeff Linderoth	(None provided)	1.653633	4
	enlight	A. Zymolka	Model to solve model of a combinatorial game ``EnLight'' Imported from the MIPLIB2010 submissions.	1.658732	5

Type:	Instance
Submitter:	MIPLIB submission pool
Description:	Imported from the MIPLIB2010 submissions.
	MIPLIB Entry

Model Group Assignment from MIPLIB:	no model group assignment
Assigned Model Group Rank/ISS in the MIC:	N.A. / N.A.

qnet1_o: Instance-to-Instance Comparison Results

Parent Instance (qnet1_o)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

qnet1_o: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary