Instance - toll-like

toll-like: Instance-to-Instance Comparison Results

Type:	Instance
Submitter:	Falk Hueffner
Description:	The NP-hard Balanced Subgraph problem (variant of MaxCut) encoded as ILPs. Real-world instances from two applications from bioinformatics, finding monotone subsystems in gene regulatory networks (http://dx.doi.org/10.1007/s10878-009-9212-2) and finding optimal layouts of tanglegrams (http://dx.doi.org/10.1007/978-3-642-11269-0). Solved by Gurobi 4.6 (8 threads) in about four days after a variable transformation reducing symmetry.
	MIPLIB Entry


	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	neos17 [MIPLIB]	liu [MIPLIB]	vpphard [MIPLIB]	s55 [MIPLIB]	s1234 [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.070	2 / 1.095	3 / 1.107	4 / 1.155	5 / 1.222
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	vpphard2 [MIPLIB]	tanglegram6 [MIPLIB]	tanglegram4 [MIPLIB]	p0201 [MIPLIB]	neos18 [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.278	29 / 1.349	70 / 1.427	105 / 1.463	561 / 1.753
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 toll-like, the five most similar instances to toll-like according to the MIC, and the five most similar instances to toll-like according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	toll-like [MIPLIB]	Falk Hueffner	The NP-hard Balanced Subgraph problem (variant of MaxCut) encoded as ILPs. Real-world instances from two applications from bioinformatics, finding monotone subsystems in gene regulatory networks (http://dx.doi.org/10.1007/s10878-009-9212-2) and finding optimal layouts of tanglegrams (http://dx.doi.org/10.1007/978-3-642-11269-0). Solved by Gurobi 4.6 (8 threads) in about four days after a variable transformation reducing symmetry.	0.000000	-
MIC Top 5	neos17 [MIPLIB]	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.070019	1
	liu [MIPLIB]	X. Liu	Floorplan and placement problem in the physical design of VLSI circuits	1.094623	2
	vpphard [MIPLIB]	C. Cardonha	Vehicle positioning problem instance	1.106881	3
	s55 [MIPLIB]	Daniel Espinoza	Wine Scheduling problem with 55 jobs and four processing machines	1.155021	4
	s1234 [MIPLIB]	Siwei Sun	These models come from my cryptographic research and are used to search for the best differential characteristics of the round-reduced versions of the block cipher Serpent with the mixed-integer programming technique. For all the models, including S1234.lp, S56701.lp, S456701.lp, I have found a feasible solution in the corresponding mst file. The challenge is that can we find better solutions or can we find the best solutions.	1.222425	5
MIPLIB Top 5	vpphard2 [MIPLIB]	C. Cardonha	Vehicle positioning problem instance. Solved using CPLEX 12.4 in 43987 seconds (May 2012). Solved using Gurobi 5.6.2 in 124 seconds (May 2014).Solved using CPLEX 12.6 in 225 seconds (May 2014).	1.278115	7
	tanglegram6 [MIPLIB]	Falk Hueffner	The NP-hard Balanced Subgraph problem (variant of MaxCut) encoded as ILPs. Real-world instances from two applications from bioinformatics, finding monotone subsystems in gene regulatory networks (http://dx.doi.org/10.1007/s10878-009-9212-2) and finding optimal layouts of tanglegrams (http://dx.doi.org/10.1007/978-3-642-11269-0).	1.349456	29
	tanglegram4 [MIPLIB]	Falk Hueffner	The NP-hard Balanced Subgraph problem (variant of MaxCut) encoded as ILPs. Real-world instances from two applications from bioinformatics, finding monotone subsystems in gene regulatory networks (http://dx.doi.org/10.1007/s10878-009-9212-2) and finding optimal layouts of tanglegrams (http://dx.doi.org/10.1007/978-3-642-11269-0).	1.427500	70
	p0201 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.462506	105
	neos18 [MIPLIB]	NEOS Server Submission	Instance coming from the NEOS Server with unknown application	1.752735	561

toll-like: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB:	huefner
Assigned Model Group Rank/ISS in the MIC:	1 / 1.172

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	huefner	markshare	scp	neos-pseudoapplication-74	neos-pseudoapplication-109
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.172	2 / 1.617	3 / 1.631	4 / 1.657	5 / 1.700

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	huefner	Falk Hueffner	The NP-hard Balanced Subgraph problem (variant of MaxCut) encoded as ILPs. Real-world models from two applications from bioinformatics, finding monotone subsystems in gene regulatory networks (http://dx.doi.org/10.1007/s10878-009-9212-2) and finding optimal layouts of tanglegrams (http://dx.doi.org/10.1007/978-3-642-11269-0).	1.172349	1
	markshare	G. Cornuéjols, M. Dawande	Market sharing problem	1.617267	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.630637	3
	neos-pseudoapplication-74	Jeff Linderoth	(None provided)	1.657305	4
	neos-pseudoapplication-109	Jeff Linderoth	(None provided)	1.699577	5

toll-like: Instance-to-Instance Comparison Results

Parent Instance (toll-like)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

toll-like: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary