cvs

Type: Model Group
Submitter: Michael Bastubbe
Description: 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.

Parent Model Group (cvs)

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

Model group: cvs
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: cvs08r139-94 Component instance: cvs16r70-62 Component instance: cvs16r89-60 Component instance: cvs16r106-72 Component instance: cvs16r128-89
Name cvs08r139-94 cvs16r70-62 cvs16r89-60 cvs16r106-72 cvs16r128-89

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-14 Model group: sing Model group: graphs Model group: allcolor Model group: aflow
Name neos-pseudoapplication-14 sing graphs allcolor aflow
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.869 2 / 0.895 3 / 1.032 4 / 1.071 5 / 1.130

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
Parent Model Group 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.000000 -
MIC Top 5 neos-pseudoapplication-14 Jeff Linderoth (None provided) 0.869092 1
sing Daniel Espinoza Imported from the MIPLIB2010 submissions. 0.895176 2
graphs Michael Bastubbe Packing Cuts in Undirected Graphs. Models are described in 4.1. 1.031581 3
allcolor Domenico Salvagnin Prepack optimization model. 1.071482 4
aflow T. Achterberg Arborescence flow problem on a graph with 40 nodes and edge density 0.9 1.130119 5


Updated August 19, 2019