Instance - comp12-2idx

comp12-2idx: Instance-to-Instance Comparison Results

Type:	Instance
Submitter:	Matias Sørensen
Description:	Instances comp01-21 of curriculum based course timetabling from the International Timetabling Competition 2007. These are time-assignment models (Stage I of the decomposed model), which are smaller than the full model, but still hard to solve.
	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	icir97_potential [MIPLIB]	cvrpb-n45k5vrpi [MIPLIB]	neos-3402294-bobin [MIPLIB]	cvrpa-n64k9vrpi [MIPLIB]	neos-3611689-kaihu [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.153	2 / 1.312	3 / 1.322	4 / 1.330	5 / 1.347
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	comp08-2idx [MIPLIB]	neos-983171 [MIPLIB]	neos18 [MIPLIB]	comp07-2idx [MIPLIB]	comp21-2idx [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.	462 / 1.917	644 / 2.042	645 / 2.045	743 / 2.145	776 / 2.200
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 comp12-2idx, the five most similar instances to comp12-2idx according to the MIC, and the five most similar instances to comp12-2idx according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	comp12-2idx [MIPLIB]	Matias Sørensen	Instances comp01-21 of curriculum based course timetabling from the International Timetabling Competition 2007. These are time-assignment models (Stage I of the decomposed model), which are smaller than the full model, but still hard to solve.	0.000000	-
MIC Top 5	icir97_potential [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.152603	1
	cvrpb-n45k5vrpi [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.312382	2
	neos-3402294-bobin [MIPLIB]	Jeff Linderoth	(None provided)	1.321808	3
	cvrpa-n64k9vrpi [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.329609	4
	neos-3611689-kaihu [MIPLIB]	Jeff Linderoth	(None provided)	1.346852	5
MIPLIB Top 5	comp08-2idx [MIPLIB]	Matias Sørensen	Instances comp01-21 of curriculum based course timetabling from the International Timetabling Competition 2007. These are time-assignment models (Stage I of the decomposed model), which are smaller than the full model, but still hard to solve.	1.916639	462
	neos-983171 [MIPLIB]	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	2.042383	644
	neos18 [MIPLIB]	NEOS Server Submission	Instance coming from the NEOS Server with unknown application	2.044711	645
	comp07-2idx [MIPLIB]	Matias Sørensen	Instances comp01-21 of curriculum based course timetabling from the International Timetabling Competition 2007. These are time-assignment models (Stage I of the decomposed model), which are smaller than the full model, but still hard to solve.	2.145382	743
	comp21-2idx [MIPLIB]	Matias Sørensen	Instances comp01-21 of curriculum based course timetabling from the International Timetabling Competition 2007. These are time-assignment models (Stage I of the decomposed model), which are smaller than the full model, but still hard to solve.	2.199780	776

comp12-2idx: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB:	coursetimetabling
Assigned Model Group Rank/ISS in the MIC:	73 / 2.552

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	hypothyroid	bnatt	scp	neos-pseudoapplication-74	neos-pseudoapplication-21
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.864	2 / 1.905	3 / 1.910	4 / 1.988	5 / 2.005

Model Group Summary

The table below contains summary information for the five most similar model groups to comp12-2idx according to the MIC.

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	hypothyroid	Gleb Belov	Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38	1.864183	1
	bnatt	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 model 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.904606	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.910158	3
	neos-pseudoapplication-74	Jeff Linderoth	(None provided)	1.988356	4
	neos-pseudoapplication-21	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	2.005040	5

comp12-2idx: Instance-to-Instance Comparison Results

Parent Instance (comp12-2idx)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

comp12-2idx: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary