neos-pseudoapplication-104

Type: Model Group
Submitter: Jeff Linderoth
Description: (None provided)

Parent Model Group (neos-pseudoapplication-104)

All other model groups below were be compared against this "query" model group.

Model group: neos-pseudoapplication-104
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.

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.
Model group: neos-pseudoapplication-24 Model group: neos-pseudoapplication-85 Model group: neos-pseudoapplication-69 Model group: chromaticindex Model group: rail0
Name neos-pseudoapplication-24 neos-pseudoapplication-85 neos-pseudoapplication-69 chromaticindex rail0
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.522 2 / 0.716 3 / 1.659 4 / 1.663 5 / 1.706

Model Group Summary

The table below contains summary information for neos-pseudoapplication-104, and for the five most similar model groups to neos-pseudoapplication-104 according to the MIC.

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
Parent Model Group neos-pseudoapplication-104 Jeff Linderoth (None provided) 0.000000 -
MIC Top 5 neos-pseudoapplication-24 Jeff Linderoth (None provided) 0.522135 1
neos-pseudoapplication-85 Jeff Linderoth (None provided) 0.715593 2
neos-pseudoapplication-69 Jeff Linderoth (None provided) 1.659456 3
chromaticindex Pierre Le Bodic Simple edge-coloring model on chains of Petersen-like subgraphs, designed to fool MIP solvers into producing very large Branch-and-Bound trees. 1.663496 4
rail0 Thomas Schlechte Track allocation problem modeled as arc coupling problem The problem was solved by CPLEX 12.4. It took approximately 170 hours. 1.706093 5