×
fhnw-sq
Type: | Model Group |
Submitter: | Simon Felix |
Description: | Combinatorial toy fesability problem: Magic square. Models 1 & 2 are feasible, model 3 is unknown. |
Parent Model Group (fhnw-sq)
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.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 | neos-pseudoapplication-70 | neos-pseudoapplication-22 | neos-pseudoapplication-40 | satellites | chromaticindex | |
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.472 | 2 / 1.600 | 3 / 1.641 | 4 / 1.652 | 5 / 1.690 |
Model Group Summary
The table below contains summary information for fhnw-sq, and for the five most similar model groups to fhnw-sq according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Model Group | fhnw-sq | Simon Felix | Combinatorial toy fesability problem: Magic square. Models 1 & 2 are feasible, model 3 is unknown. | 0.000000 | - |
MIC Top 5 | neos-pseudoapplication-70 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.472089 | 1 |
neos-pseudoapplication-22 | Jeff Linderoth | (None provided) | 1.600366 | 2 | |
neos-pseudoapplication-40 | Jeff Linderoth | (None provided) | 1.640770 | 3 | |
satellites | He Renjie | Ihe attachment is some models generated from real life satelliteschedule problem data,these models are easier comparable to real lifeproblem. The work is done by me and Alberto Ceselli from Univeristy ofMilano. I donnot know it is hard enough or not, if needs , I can generatemore difficult models. | 1.651822 | 4 | |
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.690350 | 5 |