×
cryptanalysiskb128n5obj14: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | Gleb Belov |
Description: | 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 |
MIPLIB Entry |
Parent Instance (cryptanalysiskb128n5obj14)
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 | cryptanalysiskb128n5obj16 [MIPLIB] | lectsched-4-obj [MIPLIB] | gen-ip054 [MIPLIB] | vpphard2 [MIPLIB] | timtab1 [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.136 | 2 / 1.256 | 3 / 1.305 | 4 / 1.339 | 5 / 1.343 | |
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 | cryptanalysiskb128n5obj16 [MIPLIB] | fhnw-binpack4-58 [MIPLIB] | gfd-schedulen180f7d50m30k18 [MIPLIB] | supportcase4 [MIPLIB] | neos-3603137-hoteo [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.136 | 160 / 1.530 | 425 / 1.707 | 570 / 1.803 | 791 / 2.087 | |
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 cryptanalysiskb128n5obj14, the five most similar instances to cryptanalysiskb128n5obj14 according to the MIC, and the five most similar instances to cryptanalysiskb128n5obj14 according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | cryptanalysiskb128n5obj14 [MIPLIB] | 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 | 0.000000 | - |
MIC Top 5 | cryptanalysiskb128n5obj16 [MIPLIB] | 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 | 0.135655 | 1 |
lectsched-4-obj [MIPLIB] | Harald Schilly | University lecture scheduling instance | 1.256090 | 2 | |
gen-ip054 [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.304880 | 3 | |
vpphard2 [MIPLIB] | C. Cardonha | Vehicle positioning problem instance. Solved using CPLEX 12.4 in 43987 seconds (May 2012). Solved using Gurobi 5.6.2 in 124 seconds (May 2014).Solved using CPLEX 12.6 in 225 seconds (May 2014). | 1.339022 | 4 | |
timtab1 [MIPLIB] | C. Liebchen, R. Möhring | Public transport scheduling problem | 1.342607 | 5 | |
MIPLIB Top 5 | cryptanalysiskb128n5obj16 [MIPLIB] | 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 | 0.135655 | 1 |
fhnw-binpack4-58 [MIPLIB] | Simon Felix | Feasability-only 3D bin packing with additional constraints | 1.530463 | 160 | |
gfd-schedulen180f7d50m30k18 [MIPLIB] | 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.706540 | 425 | |
supportcase4 [MIPLIB] | Michael Winkler | MIP instances collected from Gurobi forum with unknown application | 1.803083 | 570 | |
neos-3603137-hoteo [MIPLIB] | Jeff Linderoth | (None provided) | 2.086543 | 791 |
cryptanalysiskb128n5obj14: Instance-to-Model Comparison Results
Model Group Assignment from MIPLIB: | cryptanalysis |
Assigned Model Group Rank/ISS in the MIC: | 1 / 0.104 |
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 | cryptanalysis | huefner | lectsched | SiweiSun | polygonpack | |
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.104 | 2 / 1.656 | 3 / 1.682 | 4 / 1.713 | 5 / 1.738 |
Model Group Summary
The table below contains summary information for the five most similar model groups to cryptanalysiskb128n5obj14 according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
MIC Top 5 | cryptanalysis | 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 | 0.104449 | 1 |
huefner | Falk Hueffner | The NP-hard Balanced Subgraph problem (variant of MaxCut) encoded as ILPs. Real-world models from two applications from bioinformatics, finding monotone subsystems in gene regulatory networks (http://dx.doi.org/10.1007/s10878-009-9212-2) and finding optimal layouts of tanglegrams (http://dx.doi.org/10.1007/978-3-642-11269-0). | 1.656189 | 2 | |
lectsched | Harald Schilly | University lecture scheduling model | 1.681665 | 3 | |
SiweiSun | Siwei Sun | These models come from my cryptographic research and are used to search for the best differential characteristics of the round-reduced versions of the block cipher Serpent with the mixed-integer programming technique. For all the models, including S1234.lp, S56701.lp, S456701.lp, I have found a feasible solution in the corresponding mst file. The challenge is that can we find better solutions or can we find the best solutions. | 1.712668 | 4 | |
polygonpack | Antonio Frangioni | Given a set P of polygons, not necessarily convex, and a rectangle, we want to find the subset S of P with largest possible total area and a position every p in S so that there are no overlaps and they are all included in the rectangle. We allow a small set of rotations (0, 90, 180, 270 degrees) for every polygon. The problem is simplified w.r.t. the real application because the polygons do not have (fully encircled) "holes", which are supposedly filled-in separately, although they can have "bays". Models are saved as .lp. Model LpPackingModel_Dim means that we are trying to pack polygons taken from set ; there are currently 5 different sets, and is 7, 10 or 15. | 1.737563 | 5 |