Instance - neos-2075418-temuka

neos-2075418-temuka: Instance-to-Instance Comparison Results

Type:	Instance
Submitter:	Hans Mittelmann
Description:	Collection of anonymous submissions to the NEOS Server for Optimization
	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	50v-10 [MIPLIB]	p500x2988d [MIPLIB]	p500x2988 [MIPLIB]	pg [MIPLIB]	supportcase23 [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.534	2 / 0.540	3 / 0.546	4 / 0.555	5 / 0.562
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	s1234 [MIPLIB]	bnatt500 [MIPLIB]	neos-5178119-nalagi [MIPLIB]	circ10-3 [MIPLIB]	neos-4360552-sangro [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.	275 / 1.193	287 / 1.197	530 / 1.467	817 / 1.996	920 / 2.626
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-2075418-temuka, the five most similar instances to neos-2075418-temuka according to the MIC, and the five most similar instances to neos-2075418-temuka according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	neos-2075418-temuka [MIPLIB]	Hans Mittelmann	Collection of anonymous submissions to the NEOS Server for Optimization	0.000000	-
MIC Top 5	50v-10 [MIPLIB]	Serge Bisaillon	Network loading instance. Solved using ug[SCIP/spx], a distributed massively parallel version of SCIP run on 2,000 cores at the HLRN-II super computer facility.	0.533773	1
	p500x2988d [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	0.540132	2
	p500x2988 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	0.545814	3
	pg [MIPLIB]	M. Dawande	Multiproduct partial shipment model	0.555225	4
	supportcase23 [MIPLIB]	Michael Winkler	MIP instances collected from Gurobi forum with unknown application	0.562119	5
MIPLIB Top 5	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.193330	275
	bnatt500 [MIPLIB]	Tatsuya Akutsu	We are submitting ILP data for identification of a singletonattractor in a Boolean newtork, which is a well-known problemin computational systems biology.This problem is known to be NP-hard and we developed a methodto transform an instance of the problem to an integer linearprogram (ILP).We used ILPs from artificially generated Boolean networks ofindegree 3.The size of the networks are: 350, 400, 500.Even for the case of 500, we could not find a solution within6 hours using CPLEX 11.2 on a PC with XEON 5470 3.33GHz CPU.(This ILP corresponds to the case of size=350.File format is (zipped) CPLEX LP format.)The details of the method appeared in:T. Akutsu, M. Hayashida and T. Tamura, Integer programming-basedmethods for attractor detection and control of Boolean networks,Proc. The combined 48th IEEE Conference on Decision and Controland 28th Chinese Control Conference (IEEE CDC/CCC 2009), 5610-5617, 2009.	1.197292	287
	neos-5178119-nalagi [MIPLIB]	Jeff Linderoth	(None provided)	1.467060	530
	circ10-3 [MIPLIB]	M. Winkler	Instance from the 2010 SAT conference pseudo-Boolean competition	1.996015	817
	neos-4360552-sangro [MIPLIB]	Hans Mittelmann	Collection of anonymous submissions to the NEOS Server for Optimization	2.626000	920

neos-2075418-temuka: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB:	neos-pseudoapplication-62
Assigned Model Group Rank/ISS in the MIC:	182 / 3.213

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	mc	neos-pseudoapplication-7	neos-pseudoapplication-99	noip	pizza
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.979	2 / 1.130	3 / 1.171	4 / 1.255	5 / 1.299

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	mc	F. Ortega, L. Wolsey	Fixed cost network flow problems	0.979255	1
	neos-pseudoapplication-7	Jeff Linderoth	(None provided)	1.129651	2
	neos-pseudoapplication-99	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.170961	3
	noip	Christopher Hojny	integer programming formulation that verifies that no integer programming formulation of a given 0/1-point set exists	1.255486	4
	pizza	Gleb Belov	These are the models from MiniZinc Challenges 2012-2016 (see www.minizinc.org), compiled for MIP WITH INDICATOR CONSTRAINTS using the develop branch of MiniZinc and CPLEX 12.7.1 on 30 April 2017. Thus, these models can only be handled by solvers accepting indicator constraints. For models compiled with big-M/domain decomposition only, see my previous submission to MIPLIB.To recompile, create a directory MODELS, a list lst12_16.txt of the models with full paths to mzn/dzn files of each model per line, and say$> ~/install/libmzn/tests/benchmarking/mzn-test.py -l ../lst12_16.txt -slvPrf MZN-CPLEX -debug 1 -addOption "-timeout 3 -D fIndConstr=true -D fMIPdomains=false" -useJoinedName "-writeModel MODELS_IND/%s.mps" Alternatively, you can compile individual model as follows: $> mzn-cplex -v -s -G linear -output-time ../challenge_2012_2016/mznc2016_probs/zephyrus/zephyrus.mzn ../challenge_2012_2016/mznc2016_p/zephyrus/14__8__6__3.dzn -a -timeout 3 -D fIndConstr=true -D fMIPdomains=false -writeModel MODELS_IND/challenge_2012_2016mznc2016_probszephyruszephyrusmzn-challenge_2012_2016mznc2016_probszephyrus14__8__6__3dzn.mps	1.299263	5

neos-2075418-temuka: Instance-to-Instance Comparison Results

Parent Instance (neos-2075418-temuka)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

neos-2075418-temuka: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary