×
![]()
neos-pseudoapplication-2
| Type: | Model Group |
| Submitter: | NEOS Server Submission |
| Description: | Imported from the MIPLIB2010 submissions. |
Parent Model Group (neos-pseudoapplication-2)
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-913984 |
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 | sp_product | noip | ab | n37 | seqsolve | |
|
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.676 | 2 / 0.790 | 3 / 0.857 | 4 / 0.908 | 5 / 0.927 |
Model Group Summary
The table below contains summary information for neos-pseudoapplication-2, and for the five most similar model groups to neos-pseudoapplication-2 according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Model Group | neos-pseudoapplication-2 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 0.000000 | - |
| MIC Top 5 | sp_product | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 0.676448 | 1 |
| noip | Christopher Hojny | integer programming formulation that verifies that no integer programming formulation of a given 0/1-point set exists | 0.790055 | 2 | |
| ab | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 0.856688 | 3 | |
| n37 | J. Aronson | Fixed charge transportation problem | 0.908486 | 4 | |
| seqsolve | Irv Lustig | The 3 problems in this group (seqsolve1-seqsolve3) represent a hierarchical optimization process, which is derived from a customer problem for assigning people to sites into blocks of time on days of the week. The specialty of this submission is that the best known solution for seqsolveX can be used as a MIP start for seqsolveX+1. For a description of the connections between the problems, please refer to the README.txt contained in the model data for this submission, which also includes MIP start files and a Gurobi log file. | 0.927327 | 5 |
