dsbmip: Instance-to-Instance Comparison Results

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

Parent Instance (dsbmip)

All other instances below were be compared against this "query" instance.

dsbmip Raw dsbmip Decomposed dsbmip Composite of MIC top 5 dsbmip Composite of MIPLIB top 5 dsbmip Model Group Composite
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.

MIC Top 5 Instances

These are the 5 decomposed CCM images that are most similar to decomposed CCM image for the the query instance, according to the ISS metric.

Decomposed These decomposed images were created by GCG.
mad decomposed ger50-17-ptp-pop-6t decomposed osorio-cta decomposed f2gap40400 decomposed timtab1CUTS decomposed
Name mad [MIPLIB] ger50-17-ptp-pop-6t [MIPLIB] osorio-cta [MIPLIB] f2gap40400 [MIPLIB] timtab1CUTS [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.165 2 / 1.190 3 / 1.217 4 / 1.222 5 / 1.222
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
mad raw ger50-17-ptp-pop-6t raw osorio-cta raw f2gap40400 raw timtab1CUTS raw

MIPLIB Top 5 Instances

These are the 5 instances that are most closely related to the query instance, according to the instance statistic-based similarity measure employed by MIPLIB 2017

Decomposed These decomposed images were created by GCG.
transportmoment decomposed misc04inf decomposed a2c1s1 decomposed a1c1s1 decomposed dcmulti decomposed
Name transportmoment [MIPLIB] misc04inf [MIPLIB] a2c1s1 [MIPLIB] a1c1s1 [MIPLIB] dcmulti [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.
21 / 1.334 36 / 1.385 48 / 1.410 54 / 1.422 358 / 1.619
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
transportmoment raw misc04inf raw a2c1s1 raw a1c1s1 raw dcmulti raw

Instance Summary

The table below contains summary information for dsbmip, the five most similar instances to dsbmip according to the MIC, and the five most similar instances to dsbmip according to MIPLIB 2017.

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance dsbmip [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 0.000000 -
MIC Top 5 mad [MIPLIB] Koichi Fujii Mean-Absolute Deviation Model for Car Dealerships 1.164504 1
ger50-17-ptp-pop-6t [MIPLIB] C. Raack Multi-layer network design problem using a link-flow formulation over a path-flow formulation. 1.190303 2
osorio-cta [MIPLIB] Jordi Castro Set of MILP instances of the CTA (Controlled Tabular Adjustment) problem, a method to protect statistical tabular data, belonging to the field of SDC (Statistical Disclosure Control). Raw data of instances are real or pseudo-real, provided by several National Statistical Agencies. We generated the CTA problem for these data. 1.217426 3
f2gap40400 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.221521 4
timtab1CUTS [MIPLIB] C. Liebchen, R. Möhring Public transport scheduling problem 1.221628 5
MIPLIB Top 5 transportmoment [MIPLIB] G. Gamrath Transport momentum maximization in a capacitated gas network, cycles are forbidden by pseudo pressures. Solved by Gurobi 4.6.1 (12 threads) in 30 seconds (January 2012). 1.333933 21
misc04inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.384699 36
a2c1s1 [MIPLIB] M. Vyve, Y. Pochet Lot sizing instance. 1.410059 48
a1c1s1 [MIPLIB] M. Vyve, Y. Pochet Lot sizing instance. Alkis Vazacopoulos reports solving this instance using XPRESS 2006B. 1.421917 54
dcmulti [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.618594 358


dsbmip: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: no model group assignment
Assigned Model Group Rank/ISS in the MIC: N.A. / N.A.

MIC Top 5 Model Groups

These are the 5 model group composite (MGC) images that are most similar to the decomposed CCM image for the query instance, according to the ISS metric.

These are model group composite (MGC) images for the MIC top 5 model groups.
Model group: timtab Model group: scp Model group: neos-pseudoapplication-21 Model group: supportvectormachine Model group: stein
Name timtab scp neos-pseudoapplication-21 supportvectormachine stein
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.710 2 / 1.711 3 / 1.801 4 / 1.829 5 / 1.868

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 timtab C. Liebchen, R. Möhring Public transport scheduling problem 1.709554 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.710746 2
neos-pseudoapplication-21 NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.800578 3
supportvectormachine Toni Sorrell Suport vector machine with ramp loss. GSVM2-RL is the formulation found in Hess E. and Brooks P. (2015) paper, The Support Vector Machine and Mixed Integer Linear Programming: Ramp Loss SVM with L1-Norm Regularization 1.829319 4
stein MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.868288 5