Instance - triptim8


	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	pb-market-split8-70-4 [MIPLIB]	gen-ip016 [MIPLIB]	gen-ip021 [MIPLIB]	supportcase21i [MIPLIB]	mas76 [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.334	2 / 1.356	3 / 1.375	4 / 1.383	5 / 1.394
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	triptim4 [MIPLIB]	triptim1 [MIPLIB]	triptim2 [MIPLIB]	supportcase34 [MIPLIB]	triptim7* [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.	12 / 1.472	14 / 1.513	29 / 1.589	140 / 1.792	0* / 0.000*
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 triptim8, the five most similar instances to triptim8 according to the MIC, and the five most similar instances to triptim8 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	triptim8 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	0.000000	-
MIC Top 5	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.334155	1
	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.356438	2
	gen-ip021 [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.375079	3
	supportcase21i [MIPLIB]	Michael Winkler	MIP with Indicator instances collected from Gurobi forum with unknown application	1.383232	4
	mas76 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.394097	5
MIPLIB Top 5	triptim4 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.472187	12
	triptim1 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.513250	14
	triptim2 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.589170	29
	supportcase34 [MIPLIB]	Domenico Salvagnin	Instance coming from IBM developerWorks forum with unknown application.	1.791772	140
	triptim7* [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	0.000000*	0*

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	neos-pseudoapplication-21	scp	markshare	stein	generated
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.780	2 / 1.792	3 / 1.832	4 / 1.908	5 / 1.934

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	neos-pseudoapplication-21	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.780288	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.792071	2
	markshare	G. Cornuéjols, M. Dawande	Market sharing problem	1.832091	3
	stein	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.908432	4
	generated	Simon Bowly	Randomly generated integer and binary programming models. These results are part of an early phase of work aimed at generating diverse and challenging MIP models for experimental testing. We have aimed to produce small integer and binary programming models which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms.	1.933945	5

Type:	Instance
Submitter:	MIPLIB submission pool
Description:	Imported from the MIPLIB2010 submissions.
	MIPLIB Entry

Model Group Assignment from MIPLIB:	triptim
Assigned Model Group Rank/ISS in the MIC:	6 / 1.989

triptim8: Instance-to-Instance Comparison Results

Parent Instance (triptim8)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

triptim8: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary