×
square47: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | Sascha Kurz |
Description: | Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) |
MIPLIB Entry |
Parent Instance (square47)
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 | square41 [MIPLIB] | square37 [MIPLIB] | square31 [MIPLIB] | square23 [MIPLIB] | flugpl [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.278 | 2 / 0.319 | 3 / 0.333 | 4 / 0.454 | 5 / 0.778 | |
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 | square41 [MIPLIB] | square37 [MIPLIB] | square31 [MIPLIB] | square23 [MIPLIB] | ivu52 [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.
|
1 / 0.278 | 2 / 0.319 | 3 / 0.333 | 4 / 0.454 | 990 / 4.515 | |
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 square47, the five most similar instances to square47 according to the MIC, and the five most similar instances to square47 according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | square47 [MIPLIB] | Sascha Kurz | Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) | 0.000000 | - |
MIC Top 5 | square41 [MIPLIB] | Sascha Kurz | Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) | 0.278082 | 1 |
square37 [MIPLIB] | Sascha Kurz | Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) | 0.318540 | 2 | |
square31 [MIPLIB] | Sascha Kurz | Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) | 0.332586 | 3 | |
square23 [MIPLIB] | Sascha Kurz | Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) | 0.453964 | 4 | |
flugpl [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 0.777719 | 5 | |
MIPLIB Top 5 | square41 [MIPLIB] | Sascha Kurz | Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) | 0.278082 | 1 |
square37 [MIPLIB] | Sascha Kurz | Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) | 0.318540 | 2 | |
square31 [MIPLIB] | Sascha Kurz | Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) | 0.332586 | 3 | |
square23 [MIPLIB] | Sascha Kurz | Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) | 0.453964 | 4 | |
ivu52 [MIPLIB] | S. Weider | Set partitioning instance resulting from a column generation algorithm used for duty scheduling in public transportation. Solved in June 2014 using CPLEX 12.6 with 48 threads in about 25 days. | 4.515135 | 990 |
square47: Instance-to-Model Comparison Results
Model Group Assignment from MIPLIB: | square |
Assigned Model Group Rank/ISS in the MIC: | 1 / 0.752 |
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 | square | supportvectormachine | drayage | neos-pseudoapplication-2 | neos-pseudoapplication-74 | |
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.753 | 2 / 1.339 | 3 / 1.345 | 4 / 1.370 | 5 / 1.380 |
Model Group Summary
The table below contains summary information for the five most similar model groups to square47 according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
MIC Top 5 | square | Sascha Kurz | Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) | 0.752692 | 1 |
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.339136 | 2 | |
drayage | F. Jordan Srour | The .rar file contains three folders: 1) R_mps with all of the models (165, organized into 5 groups R0_, R25_, R50_, R75_, and R100_*), 2) results_and_runtimes with datafiles on the runtime and results, and 3) doc with documentation on the models in the form of a pdf. | 1.345405 | 3 | |
neos-pseudoapplication-2 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.369533 | 4 | |
neos-pseudoapplication-74 | Jeff Linderoth | (None provided) | 1.380223 | 5 |