sing

Type: Model Group
Submitter: Daniel Espinoza
Description: Imported from the MIPLIB2010 submissions.

Parent Model Group (sing)

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

Model group: sing
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.
Component instance: sing326 Component instance: sing11 Component instance: sing17 Component instance: sing44 Component instance: sing5
Name sing326 sing11 sing17 sing44 sing5

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: graphs Model group: neos-pseudoapplication-14 Model group: allcolor Model group: neos-pseudoapplication-27 Model group: cvs
Name graphs neos-pseudoapplication-14 allcolor neos-pseudoapplication-27 cvs
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.683 2 / 0.692 3 / 0.720 4 / 0.737 5 / 0.895

Model Group Summary

The table below contains summary information for sing, and for the five most similar model groups to sing according to the MIC.

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
Parent Model Group sing Daniel Espinoza Imported from the MIPLIB2010 submissions. 0.000000 -
MIC Top 5 graphs Michael Bastubbe Packing Cuts in Undirected Graphs. Models are described in 4.1. 0.682808 1
neos-pseudoapplication-14 Jeff Linderoth (None provided) 0.691501 2
allcolor Domenico Salvagnin Prepack optimization model. 0.720295 3
neos-pseudoapplication-27 NEOS Server Submission Imported from the MIPLIB2010 submissions. 0.737112 4
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. 0.895176 5


Updated August 19, 2019