Instance - supportcase39


	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	neos-4647027-thurso [MIPLIB]	neos-4647030-tutaki [MIPLIB]	graphdraw-gemcutter [MIPLIB]	gen-ip054 [MIPLIB]	scpm1 [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.506	2 / 1.519	3 / 1.566	4 / 1.568	5 / 1.578
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	gen-ip016 [MIPLIB]	gen-ip036 [MIPLIB]	flugplinf [MIPLIB]	haprp [MIPLIB]	neos-5044663-wairoa [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.	7 / 1.612	28 / 1.710	38 / 1.738	183 / 1.906	923 / 2.771
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 supportcase39, the five most similar instances to supportcase39 according to the MIC, and the five most similar instances to supportcase39 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	supportcase39 [MIPLIB]	Domenico Salvagnin	Instance coming from IBM developerWorks forum with unknown application.	0.000000	-
MIC Top 5	neos-4647027-thurso [MIPLIB]	Hans Mittelmann	Collection of anonymous submissions to the NEOS Server for Optimization	1.505780	1
	neos-4647030-tutaki [MIPLIB]	Hans Mittelmann	Collection of anonymous submissions to the NEOS Server for Optimization	1.519458	2
	graphdraw-gemcutter [MIPLIB]	Cézar Augusto Nascimento e Silva	In the Graph Drawing problem a set of symbols must be placed in a plane and their connections routed. The objective is to produce aesthetically pleasant, easy to read diagrams. As a primary concern one usually tries to minimize edges crossing, edges' length, waste of space and number of bents in the connections. When formulated with these constraints the problem becomes NP-Hard . In practice many additional complicating requirements can be included, such as non-uniform sizes for symbols. Thus, some heuristics such as the generalized force-direct method and Simulated Annealing have been proposed to tackle this problem. uses a grid structure to approach the Entity-Relationship (ER) drawing problem, emphasizing the differences between ER drawing and the more classical circuit drawing problems. presented different ways of producing graph layouts (e.g.: tree, orthogonal, visibility representations, hierarchic, among others) for general graphs with applications on different subjects. The ability to automatically produce high quality layouts is very important in many applications, one of these is Software Engineering: the availability of easy to understand ER diagrams, for instance, can improve the time needed for developers to master database models and increase their productivity. Our solution approach involves two phases: (\\(i\\)) firstly the optimal placement of entities is solved, i.e.: entities are positioned so as to minimize the distances between connected entities; and (\\(ii\\)) secondly, edges are routed minimizing bends and avoiding the inclusion of connectors too close. We present the model for the first phase of our problem.	1.566066	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.567809	4
	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.578267	5
MIPLIB Top 5	gen-ip016 [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. Solved with XPRESS in a few seconds.	1.611690	7
	gen-ip036 [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.709750	28
	flugplinf [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.737609	38
	haprp [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.906302	183
	neos-5044663-wairoa [MIPLIB]	Hans Mittelmann	NEOS submission with known submitter	2.771394	923

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	scp	markshare	stein	neos-pseudoapplication-21	shs
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 / 2.029	2 / 2.068	3 / 2.160	4 / 2.172	5 / 2.179

Model Group Summary

The table below contains summary information for the five most similar model groups to supportcase39 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	2.029060	1
	markshare	G. Cornuéjols, M. Dawande	Market sharing problem	2.067848	2
	stein	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	2.159838	3
	neos-pseudoapplication-21	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	2.172349	4
	shs	Christoph Helmberg	Joint online truck scheduling and inventory management for multiple warehouses.	2.179223	5

Type:	Instance
Submitter:	Domenico Salvagnin
Description:	Instance coming from IBM developerWorks forum with unknown application.
	MIPLIB Entry

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

supportcase39: Instance-to-Instance Comparison Results

Parent Instance (supportcase39)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

supportcase39: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary