×
![]()
opm2
| Type: | Model Group |
| Submitter: | Daniel Espinoza |
| Description: | Problems coming from precedence constrained knapsacks arising in mining applications. These are one-period problems with integer data but large root LP GAP |
Parent Model Group (opm2)
All other model groups below were be compared against this "query" model group.  |
 |
|
Model Group Composite (MGC) image
Composite of the decomposed CCM images for every instance in the query model group.
|
Component Instances (Decomposed)
These are the decomposed CCM images for each instance in the query model group. |
These are component instance images.
|
 |
 |
 |
 |
 |
| Name | opm2-z7-s8 | opm2-z10-s4 | opm2-z12-s8 | opm2-z8-s0 | opm2-z6-s1 |
MIC Top 5 Model Groups
These are the 5 MGC images that are most similar to the MGC image for the query model group, according to the ISS metric. |
FIXME - These are model group composite images.
|
 |
 |
 |
 |
 |
| Name | mine | iis | assign1 | neos-pseudoapplication-106 | 2hopcds | |
|
Rank / ISS
The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query model group and all other model groups. A smaller ISS value indicates greater similarity.
|
1 / 1.983 | 2 / 2.073 | 3 / 2.095 | 4 / 2.121 | 5 / 2.143 |
Model Group Summary
The table below contains summary information for opm2, and for the five most similar model groups to opm2 according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Model Group | opm2 | Daniel Espinoza | Problems coming from precedence constrained knapsacks arising in mining applications. These are one-period problems with integer data but large root LP GAP | 0.000000 | - |
| MIC Top 5 | mine | Andreas Bley | Multi-period mine production scheduling model | 1.982634 | 1 |
| iis | Marc Pfetsch | 23 "middlehard" Set-Covering Models for MIPLIB: they have a small number of variables compared to the number of constraints and CPLEX 12.1 needs about one hour to solve them.For more information, have a look into the readme file which explains how the models can be created. | 2.072737 | 2 | |
| assign1 | Robert Fourer | Imported from the MIPLIB2010 submissions. | 2.095345 | 3 | |
| neos-pseudoapplication-106 | Hans Mittelmann | Collection of anonymous submissions to the NEOS Server for Optimization | 2.120538 | 4 | |
| 2hopcds | Austin Buchanan | A problem in wireless networks. The objective is to select a minimum number of relay nodes so that any two nonadjacent nodes can communicate by way of the chosen relay nodes in at most s hops, where s is a problem input. The 2-hop case of this problem can be formulated as a set cover/hitting set problem with n binary variables and n^2 constraints: _{ k N(i) N(j) } x_k 1 for nonadjacent node pairs {i,j}. Despite the formulation's simplicity, models with as few as 120 variables are left unsolved after one hour using Gurobi 7.0.2. | 2.142568 | 5 |
