Instance - neos-3696678-lyvia


	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	allcolor10 [MIPLIB]	shiftreg2-7 [MIPLIB]	allcolor58 [MIPLIB]	sing5 [MIPLIB]	shiftreg1-4 [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 / 0.850	2 / 0.852	3 / 0.852	4 / 0.854	5 / 0.859
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	neos-3581454-haast [MIPLIB]	p0201 [MIPLIB]	graphdraw-gemcutter [MIPLIB]	pw-myciel4 [MIPLIB]	physiciansched5-3 [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.	9 / 0.894	209 / 1.183	445 / 1.436	797 / 2.022	842 / 2.156
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-3696678-lyvia, the five most similar instances to neos-3696678-lyvia according to the MIC, and the five most similar instances to neos-3696678-lyvia according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	neos-3696678-lyvia [MIPLIB]	Jeff Linderoth	(None provided)	0.000000	-
MIC Top 5	allcolor10 [MIPLIB]	Domenico Salvagnin	Prepack optimization instance.	0.849692	1
	shiftreg2-7 [MIPLIB]	Domenico Salvagnin	Multi-activity shift scheduling problem with 2 activities and 12 employees, using an implicit model based on a regular language.	0.851724	2
	allcolor58 [MIPLIB]	Domenico Salvagnin	Prepack optimization model.	0.852186	3
	sing5 [MIPLIB]	Daniel Espinoza	Imported from the MIPLIB2010 submissions.	0.853808	4
	shiftreg1-4 [MIPLIB]	Domenico Salvagnin	Multi-activity shift scheduling problem with 1 activity and 12 employees, using an implicit model based on a regular language.	0.859233	5
MIPLIB Top 5	neos-3581454-haast [MIPLIB]	Jeff Linderoth	(None provided)	0.894010	9
	p0201 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.182931	209
	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.436341	445
	pw-myciel4 [MIPLIB]	Arie Koster	Model to compute the pathwidth of Mycielski-4 instance from DIMACS graph coloring database	2.021915	797
	physiciansched5-3 [MIPLIB]	Pelin Damci-Kurt	Physician scheduling problem for hospitalist, radiology and kidney specialist groups.	2.155811	842

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	allcolor	map	rmatr	polygonpack	sp_product
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.167	2 / 1.207	3 / 1.247	4 / 1.280	5 / 1.282

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	allcolor	Domenico Salvagnin	Prepack optimization model.	1.167461	1
	map	Kiyan Ahmadizadeh	Land parcel selection problems motivated by Red-Cockaded Woodpecker conservation problem	1.207052	2
	rmatr	Dmitry Krushinsky	Model coming from a formulation of the p-Median problem using square cost matrices	1.247485	3
	polygonpack	Antonio Frangioni	Given a set P of polygons, not necessarily convex, and a rectangle, we want to find the subset S of P with largest possible total area and a position every p in S so that there are no overlaps and they are all included in the rectangle. We allow a small set of rotations (0, 90, 180, 270 degrees) for every polygon. The problem is simplified w.r.t. the real application because the polygons do not have (fully encircled) "holes", which are supposedly filled-in separately, although they can have "bays". Models are saved as .lp. Model LpPackingModel_Dim means that we are trying to pack polygons taken from set ; there are currently 5 different sets, and is 7, 10 or 15.	1.280326	4
	sp_product	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.281680	5

Type:	Instance
Submitter:	Jeff Linderoth
Description:	(None provided)
	MIPLIB Entry

Model Group Assignment from MIPLIB:	neos-pseudoapplication-56
Assigned Model Group Rank/ISS in the MIC:	215 / 3.675

neos-3696678-lyvia: Instance-to-Instance Comparison Results

Parent Instance (neos-3696678-lyvia)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

neos-3696678-lyvia: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary