×
![]()
maxfeassub
| Type: | Model Group |
| Submitter: | Marc Pfetsch |
| Description: | Set covering problems arising from a Benders algorithm for finding maximum feasible subsystems. More details on the generation is given in the README file in the tarball. |
Parent Model Group (maxfeassub)
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 | glass-sc |
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 | assign1 | f2gap | 2hopcds | mod | iis | |
|
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 / 0.988 | 2 / 1.093 | 3 / 1.135 | 4 / 1.287 | 5 / 1.301 |
Model Group Summary
The table below contains summary information for maxfeassub, and for the five most similar model groups to maxfeassub according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Model Group | maxfeassub | Marc Pfetsch | Set covering problems arising from a Benders algorithm for finding maximum feasible subsystems. More details on the generation is given in the README file in the tarball. | 0.000000 | - |
| MIC Top 5 | assign1 | Robert Fourer | Imported from the MIPLIB2010 submissions. | 0.987513 | 1 |
| f2gap | Salim Haddadi | Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) | 1.092958 | 2 | |
| 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. | 1.135296 | 3 | |
| mod | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.286885 | 4 | |
| 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. | 1.301176 | 5 |
