Instance - neos-4165869-wannon


	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	liu [MIPLIB]	scpm1 [MIPLIB]	probportfolio [MIPLIB]	gen-ip054 [MIPLIB]	fhnw-binpack4-77 [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.336	2 / 1.368	3 / 1.428	4 / 1.428	5 / 1.437
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	seqsolve2short4288 [MIPLIB]	seqsolve1 [MIPLIB]	allcolor10 [MIPLIB]	allcolor58 [MIPLIB]	tokyometro [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.	302 / 1.792	304 / 1.792	527 / 1.900	529 / 1.902	537 / 1.912
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 neos-4165869-wannon, the five most similar instances to neos-4165869-wannon according to the MIC, and the five most similar instances to neos-4165869-wannon according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	neos-4165869-wannon [MIPLIB]	Hans Mittelmann	Collection of anonymous submissions to the NEOS Server for Optimization	0.000000	-
MIC Top 5	liu [MIPLIB]	X. Liu	Floorplan and placement problem in the physical design of VLSI circuits	1.336076	1
	scpm1 [MIPLIB]	Shunji Umetani	This is a random test instance 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 instances. We have also generated reduced instances 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 instance generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark	1.367898	2
	probportfolio [MIPLIB]	Feng Qiu	Sample average approximation formulation of a probabilistic portfolio optimization problem. Solved using ug[SCIP/spx], a distributed massively parallel version of SCIP run on 2,000 cores at the HLRN-II super computer facility.	1.428073	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.428491	4
	fhnw-binpack4-77 [MIPLIB]	Simon Felix	Feasability-only 3D bin packing with additional constraints	1.437234	5
MIPLIB Top 5	seqsolve2short4288 [MIPLIB]	Irv Lustig	The 3 problems in this group (seqsolve1-seqsolve3) represent a hierarchical optimization process, which is derived from a customer problem for assigning people to sites into blocks of time on days of the week. The specialty of this submission is that the best known solution for seqsolveX can be used as a MIP start for seqsolveX+1. For a description of the connections between the problems, please refer to the README.txt contained in the model data for this submission, which also includes MIP start files and a Gurobi log file.	1.791575	302
	seqsolve1 [MIPLIB]	Irv Lustig	The 3 problems in this group (seqsolve1-seqsolve3) represent a hierarchical optimization process, which is derived from a customer problem for assigning people to sites into blocks of time on days of the week. The specialty of this submission is that the best known solution for seqsolveX can be used as a MIP start for seqsolveX+1. For a description of the connections between the problems, please refer to the README.txt contained in the model data for this submission, which also includes MIP start files and a Gurobi log file.	1.791980	304
	allcolor10 [MIPLIB]	Domenico Salvagnin	Prepack optimization instance.	1.900090	527
	allcolor58 [MIPLIB]	Domenico Salvagnin	Prepack optimization model.	1.901903	529
	tokyometro [MIPLIB]	Hsiang-Yun WU	The layout model for Tokyo Metro Map	1.911848	537

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	scp	markshare	stein	neos-pseudoapplication-109	neos-pseudoapplication-21
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.626	2 / 1.738	3 / 1.820	4 / 1.842	5 / 1.892

Model Group Summary

The table below contains summary information for the five most similar model groups to neos-4165869-wannon according to the MIC.

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	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.625821	1
	markshare	G. Cornuéjols, M. Dawande	Market sharing problem	1.737958	2
	stein	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.819651	3
	neos-pseudoapplication-109	Jeff Linderoth	(None provided)	1.841609	4
	neos-pseudoapplication-21	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.891537	5

Type:	Instance
Submitter:	Hans Mittelmann
Description:	Collection of anonymous submissions to the NEOS Server for Optimization
	MIPLIB Entry

Model Group Assignment from MIPLIB:	neos-pseudoapplication-44
Assigned Model Group Rank/ISS in the MIC:	102 / 2.717

neos-4165869-wannon: Instance-to-Instance Comparison Results

Parent Instance (neos-4165869-wannon)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

neos-4165869-wannon: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary