neos-4382714-ruvuma: Instance-to-Instance Comparison Results

Type: Instance
Submitter: Hans Mittelmann
Description: Collection of anonymous submissions to the NEOS Server for Optimization
MIPLIB Entry

Parent Instance (neos-4382714-ruvuma)

All other instances below were be compared against this "query" instance.

neos-4382714-ruvuma Raw neos-4382714-ruvuma Decomposed neos-4382714-ruvuma Composite of MIC top 5 neos-4382714-ruvuma Composite of MIPLIB top 5 neos-4382714-ruvuma Model Group Composite
Raw This is the CCM image before the decomposition procedure has been applied.
Decomposed This is the CCM image after a decomposition procedure has been applied. This is the image used by the MIC's image-based comparisons for this query instance.
Composite of MIC Top 5 Composite of the five decomposed CCM images from the MIC Top 5.
Composite of MIPLIB Top 5 Composite of the five decomposed CCM images from the MIPLIB Top 5.
Model Group Composite Image Composite of the decomposed CCM images for every instance in the same model group as this query.

MIC Top 5 Instances

These are the 5 decomposed CCM images that are most similar to decomposed CCM image for the the query instance, according to the ISS metric.

Decomposed These decomposed images were created by GCG.
qap10 decomposed eil33-2 decomposed neos5 decomposed reblock115 decomposed 2club200v15p5scn decomposed
Name qap10 [MIPLIB] eil33-2 [MIPLIB] neos5 [MIPLIB] reblock115 [MIPLIB] 2club200v15p5scn [MIPLIB]
Rank / ISS The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query instance and all other instances. A smaller ISS value indicates greater similarity.
1 / 1.069 2 / 1.183 3 / 1.247 4 / 1.260 5 / 1.262
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
qap10 raw eil33-2 raw neos5 raw reblock115 raw 2club200v15p5scn raw

MIPLIB Top 5 Instances

These are the 5 instances that are most closely related to the query instance, according to the instance statistic-based similarity measure employed by MIPLIB 2017

Decomposed These decomposed images were created by GCG.
air04 decomposed ponderthis0517-inf decomposed air05 decomposed neos-3226448-wkra decomposed h80x6320 decomposed
Name air04 [MIPLIB] ponderthis0517-inf [MIPLIB] air05 [MIPLIB] neos-3226448-wkra [MIPLIB] h80x6320 [MIPLIB]
Rank / ISS The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query instance and all model groups. A smaller ISS value indicates greater similarity.
82 / 1.712 83 / 1.714 142 / 1.873 283 / 2.080 919 / 2.508
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
air04 raw ponderthis0517-inf raw air05 raw neos-3226448-wkra raw h80x6320 raw

Instance Summary

The table below contains summary information for neos-4382714-ruvuma, the five most similar instances to neos-4382714-ruvuma according to the MIC, and the five most similar instances to neos-4382714-ruvuma according to MIPLIB 2017.

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance neos-4382714-ruvuma [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization 0.000000 -
MIC Top 5 qap10 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.068919 1
eil33-2 [MIPLIB] J. Linderoth Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB 1.183475 2
neos5 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.247068 3
reblock115 [MIPLIB] Andreas Bley Multi-period mine production scheduling instances 1.260154 4
2club200v15p5scn [MIPLIB] Balabhaskar Balasundaram Maximum 2-club instance; graph; clique relaxations Solved with Gurobi 8.1 on 24 cores in approx. 23 hours. 1.261935 5
MIPLIB Top 5 air04 [MIPLIB] G. Astfalk Airline crew scheduling set partitioning problem 1.712195 82
ponderthis0517-inf [MIPLIB] Rob Pratt Infeasible version of IBM Ponder This problem (with 52 characters and no spaces) from May 2017: https://www.research.ibm.com/haifa/ponderthis/challenges/May2017.html 1.714316 83
air05 [MIPLIB] G. Astfalk Airline crew scheduling set partitioning problem 1.873476 142
neos-3226448-wkra [MIPLIB] Jeff Linderoth (None provided) 2.079597 283
h80x6320 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 2.507996 919


neos-4382714-ruvuma: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: neos-pseudoapplication-103
Assigned Model Group Rank/ISS in the MIC: 1 / 1.330

MIC Top 5 Model Groups

These are the 5 model group composite (MGC) images that are most similar to the decomposed CCM image for the query instance, according to the ISS metric.

These are model group composite (MGC) images for the MIC top 5 model groups.
Model group: neos-pseudoapplication-103 Model group: f2gap Model group: 2hopcds Model group: generated Model group: neos-pseudoapplication-101
Name neos-pseudoapplication-103 f2gap 2hopcds generated neos-pseudoapplication-101
Rank / ISS The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query instance and all other instances. A smaller ISS value indicates greater similarity.
1 / 1.330 2 / 1.646 3 / 1.767 4 / 1.828 5 / 1.852

Model Group Summary

The table below contains summary information for the five most similar model groups to neos-4382714-ruvuma according to the MIC.

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 neos-pseudoapplication-103 Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization 1.330234 1
f2gap Salim Haddadi Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.645745 2
2hopcds Austin Buchanan A problem in wireless networks. The objective is to select a minimum number of relay nodes so that any two nonadjacent nodes can communicate by way of the chosen relay nodes in at most s hops, where s is a problem input. The 2-hop case of this problem can be formulated as a set cover/hitting set problem with n binary variables and n^2 constraints: _{ k N(i) N(j) } x_k 1 for nonadjacent node pairs {i,j}. Despite the formulation's simplicity, models with as few as 120 variables are left unsolved after one hour using Gurobi 7.0.2. 1.767372 3
generated Simon Bowly Randomly generated integer and binary programming models. These results are part of an early phase of work aimed at generating diverse and challenging MIP models for experimental testing. We have aimed to produce small integer and binary programming models which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms. 1.827814 4
neos-pseudoapplication-101 NEOS Server Submission Model coming from the NEOS Server with unknown application. Infeasibility claimed by CPLEX 12.6 and CPLEX 12.6.1 with extreme numerical caution emphasi after 4 and 2 hours computation, respectively. 1.852416 5