×
neos-pseudoapplication-9
Type: | Model Group |
Submitter: | NEOS Server Submission |
Description: | Model coming from the NEOS Server with unknown application. |
Parent Model Group (neos-pseudoapplication-9)
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-1420790 | neos-3660371-kurow | neos-1420546 | neos-3665875-lesum | ns1679495 |
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 | nj | shiftreg | sing | cvs | neos-pseudoapplication-14 | |
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.879 | 2 / 1.890 | 3 / 1.897 | 4 / 1.899 | 5 / 1.908 |
Model Group Summary
The table below contains summary information for neos-pseudoapplication-9, and for the five most similar model groups to neos-pseudoapplication-9 according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Model Group | neos-pseudoapplication-9 | NEOS Server Submission | Model coming from the NEOS Server with unknown application. | 0.000000 | - |
MIC Top 5 | nj | Jonathan Eckstein | Electoral district design with various levels of symmetry breaking constraints. | 1.878637 | 1 |
shiftreg | Domenico Salvagnin | Multi-activity shift scheduling problem with 1 activity and 12 employees, using an implicit model based on a regular language. | 1.889723 | 2 | |
sing | Daniel Espinoza | Imported from the MIPLIB2010 submissions. | 1.897152 | 3 | |
cvs | Michael Bastubbe | Capacitated vertex separator problem on randomly generated hypergraph with 128 vertices and 89 hyperedges in at most 16 components each including at most 8 vertices. solved with default GCG/Soplex in about 2000 seconds. | 1.898860 | 4 | |
neos-pseudoapplication-14 | Jeff Linderoth | (None provided) | 1.908036 | 5 |