×
![]()
neos-pseudoapplication-51
| Type: | Model Group |
| Submitter: | NEOS Server Submission |
| Description: | Model coming from the NEOS Server with unknown application |
Parent Model Group (neos-pseudoapplication-51)
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 | neos-4797081-pakoka | neos-4754521-awarau | neos-3237086-abava | neos-5129192-manaia | ns1116954 |
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 | maxfeassub | iis | network_design | neos-pseudoapplication-106 | neos-pseudoapplication-78 | |
|
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.670 | 2 / 1.736 | 3 / 1.765 | 4 / 1.765 | 5 / 1.775 |
Model Group Summary
The table below contains summary information for neos-pseudoapplication-51, and for the five most similar model groups to neos-pseudoapplication-51 according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Model Group | neos-pseudoapplication-51 | NEOS Server Submission | Model coming from the NEOS Server with unknown application | 0.000000 | - |
| MIC Top 5 | 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. | 1.670334 | 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. | 1.735561 | 2 | |
| network_design | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.765041 | 3 | |
| neos-pseudoapplication-106 | Hans Mittelmann | Collection of anonymous submissions to the NEOS Server for Optimization | 1.765442 | 4 | |
| neos-pseudoapplication-78 | Jeff Linderoth | (None provided) | 1.774845 | 5 |
