Instance - neos-3603137-hoteo


	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	triptim1 [MIPLIB]	irp [MIPLIB]	pb-market-split8-70-4 [MIPLIB]	gen-ip016 [MIPLIB]	gen-ip002 [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.617	2 / 1.628	3 / 1.629	4 / 1.645	5 / 1.646
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-3211096-shag [MIPLIB]	neos-3355323-arnon [MIPLIB]	no-ip-64999 [MIPLIB]	lectsched-3 [MIPLIB]	no-ip-65059* [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.	242 / 1.958	265 / 1.970	281 / 1.978	714 / 2.193	281* / 1.978*
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-3603137-hoteo, the five most similar instances to neos-3603137-hoteo according to the MIC, and the five most similar instances to neos-3603137-hoteo according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	neos-3603137-hoteo [MIPLIB]	Jeff Linderoth	(None provided)	0.000000	-
MIC Top 5	triptim1 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.617095	1
	irp [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.627992	2
	pb-market-split8-70-4 [MIPLIB]	Gleb Belov	These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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.628844	3
	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.644509	4
	gen-ip002 [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.645793	5
MIPLIB Top 5	neos-3211096-shag [MIPLIB]	Jeff Linderoth	Solved with status infeasible by ParaSCIP in 42484 sec.\xa0It was confirmed by ParaXpress.	1.957568	242
	neos-3355323-arnon [MIPLIB]	Jeff Linderoth	(None provided)	1.969622	265
	no-ip-64999 [MIPLIB]	Christopher Hojny	integer programming formulation that verifies that no integer programming formulation of a given 0/1-point set exists	1.978272	281
	lectsched-3 [MIPLIB]	Harald Schilly	University lecture scheduling instance	2.192532	714
	no-ip-65059* [MIPLIB]	Christopher Hojny	integer programming formulation that verifies that no integer programming formulation of a given 0/1-point set exists	1.978272*	281*

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	neos-pseudoapplication-77	scp	neos-pseudoapplication-21	stein	neos-pseudoapplication-90
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.917	2 / 1.929	3 / 1.938	4 / 1.960	5 / 1.965

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	neos-pseudoapplication-77	Jeff Linderoth	(None provided)	1.916554	1
	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.929285	2
	neos-pseudoapplication-21	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.938060	3
	stein	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.960232	4
	neos-pseudoapplication-90	NEOS Server Submission	Model coming from the NEOS Server with unknown application	1.964879	5

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

Model Group Assignment from MIPLIB:	neos-pseudoapplication-38
Assigned Model Group Rank/ISS in the MIC:	149 / 2.944

neos-3603137-hoteo: Instance-to-Instance Comparison Results

Parent Instance (neos-3603137-hoteo)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

neos-3603137-hoteo: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary