×
![]()
neos-631517: Instance-to-Instance Comparison Results
| Type: | Instance |
| Submitter: | NEOS Server Submission |
| Description: | Imported from the MIPLIB2010 submissions. |
| MIPLIB Entry |
Parent Instance (neos-631517)
All other instances below were be compared against this "query" instance.  |
 |
 |
 |
 |
 |
|
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.
|
 |
 |
 |
 |
 |
| Name | gt2 [MIPLIB] | timtab1 [MIPLIB] | fhnw-sq2 [MIPLIB] | neos-5192052-neckar [MIPLIB] | prod1 [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.942 | 2 / 1.008 | 3 / 1.020 | 4 / 1.023 | 5 / 1.041 | |
|
Raw
These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
|
 |
 |
 |
 |
 |
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.
|
 |
 |
 |
 |
 |
| Name | neos-911970 [MIPLIB] | neos-5140963-mincio [MIPLIB] | rlp1 [MIPLIB] | assign1-5-8 [MIPLIB] | bppc8-09 [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.
|
35 / 1.159 | 38 / 1.166 | 221 / 1.292 | 273 / 1.332 | 920 / 2.586 | |
|
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-631517, the five most similar instances to neos-631517 according to the MIC, and the five most similar instances to neos-631517 according to MIPLIB 2017.
| INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Instance | neos-631517 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 0.000000 | - |
| MIC Top 5 | gt2 [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 0.942420 | 1 |
| timtab1 [MIPLIB] | C. Liebchen, R. Möhring | Public transport scheduling problem | 1.007782 | 2 | |
| fhnw-sq2 [MIPLIB] | Simon Felix | Combinatorial toy fesability problem: Magic square. Instances 1 & 2 are feasible, instance 3 is unknown. Reported to be solved after 46883 seconds with ParaSCIP using 72 cores. | 1.020333 | 3 | |
| neos-5192052-neckar [MIPLIB] | Jeff Linderoth | (None provided) | 1.023455 | 4 | |
| prod1 [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.040769 | 5 | |
| MIPLIB Top 5 | neos-911970 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.158834 | 35 |
| neos-5140963-mincio [MIPLIB] | Jeff Linderoth | (None provided) | 1.166418 | 38 | |
| rlp1 [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.291537 | 221 | |
| assign1-5-8 [MIPLIB] | Robert Fourer | Imported from the MIPLIB2010 submissions. | 1.332316 | 273 | |
| bppc8-09 [MIPLIB] | Manuel Iori | The models that we attach solve the "bar-relaxation", also known as the "Bin Packing Problem with Contiguity" or the "P||Cmax with contiguity". This is one of the most interesting relaxations for two dimensional cutting and packing problems. Its solution by means of an ILP software is the bottleneck of the primal decomposition methods that we attempted in the paper cited below. In detail, the files correspond to model (12)-(15) in the paper, applied to the instances of the Classes 4, 6 and 8 by Martello and Vigo (Management Science, 1998). | 2.585960 | 920 |
neos-631517: Instance-to-Model Comparison Results
| Model Group Assignment from MIPLIB: | neos-pseudoapplication-70 |
| Assigned Model Group Rank/ISS in the MIC: | 1 / 1.243 |
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.
|
|
 |
 |
 |
 |
| Name | neos-pseudoapplication-70 | neos-pseudoapplication-74 | timtab | scp | supportvectormachine | |
|
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.244 | 2 / 1.611 | 3 / 1.674 | 4 / 1.678 | 5 / 1.769 |
Model Group Summary
The table below contains summary information for the five most similar model groups to neos-631517 according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| MIC Top 5 | neos-pseudoapplication-70 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.243961 | 1 |
| neos-pseudoapplication-74 | Jeff Linderoth | (None provided) | 1.611095 | 2 | |
| timtab | C. Liebchen, R. Möhring | Public transport scheduling problem | 1.673663 | 3 | |
| 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.678133 | 4 | |
| 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.768506 | 5 |
