air04: Instance-to-Instance Comparison Results

Type: Instance
Submitter: G. Astfalk
Description: Airline crew scheduling set partitioning problem
MIPLIB Entry

Parent Instance (air04)

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

air04 Raw air04 Decomposed air04 Composite of MIC top 5 air04 Composite of MIPLIB top 5 air04 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.
air05 decomposed core2536-691 decomposed v150d30-2hopcds decomposed fast0507 decomposed core4284-1064 decomposed
Name air05 [MIPLIB] core2536-691 [MIPLIB] v150d30-2hopcds [MIPLIB] fast0507 [MIPLIB] core4284-1064 [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 / 0.916 2 / 0.927 3 / 0.940 4 / 0.963 5 / 0.976
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
air05 raw core2536-691 raw v150d30-2hopcds raw fast0507 raw core4284-1064 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.
air05 decomposed mod010 decomposed 10teams decomposed air03 decomposed ds decomposed
Name air05 [MIPLIB] mod010 [MIPLIB] 10teams [MIPLIB] air03 [MIPLIB] ds [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.
1 / 0.916 52 / 1.518 141 / 2.200 164 / 2.288 233 / 2.518
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
air05 raw mod010 raw 10teams raw air03 raw ds raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance air04 [MIPLIB] G. Astfalk Airline crew scheduling set partitioning problem 0.000000 -
MIC Top 5 air05 [MIPLIB] G. Astfalk Airline crew scheduling set partitioning problem 0.915764 1
core2536-691 [MIPLIB] A. Caprara, M. Fischetti, P. Toth Set covering instance coming from Italian railway models 0.926891 2
v150d30-2hopcds [MIPLIB] 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, instances with as few as 120 variables are left unsolved after one hour using Gurobi 7.0.2. 0.939842 3
fast0507 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 0.962692 4
core4284-1064 [MIPLIB] A. Caprara, M. Fischetti, P. Toth Set covering instance coming from Italian railway models 0.975573 5
MIPLIB Top 5 air05 [MIPLIB] G. Astfalk Airline crew scheduling set partitioning problem 0.915764 1
mod010 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.518443 52
10teams [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 2.199964 141
air03 [MIPLIB] G. Astfalk Airline crew scheduling set partitioning problem 2.288381 164
ds [MIPLIB] MIPLIB submission pool Imported from MIPLIB2003. 2.517934 233


air04: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: air
Assigned Model Group Rank/ISS in the MIC: 13 / 1.493

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: 2hopcds Model group: iis Model group: neos-pseudoapplication-106 Model group: assign1 Model group: f2gap
Name 2hopcds iis neos-pseudoapplication-106 assign1 f2gap
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 / 0.992 2 / 1.057 3 / 1.170 4 / 1.179 5 / 1.209

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 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. 0.991618 1
iis Marc Pfetsch 23 "middlehard" Set-Covering Models for MIPLIB: they have a small number of variables compared to the number of constraints and CPLEX 12.1 needs about one hour to solve them.For more information, have a look into the readme file which explains how the models can be created. 1.057493 2
neos-pseudoapplication-106 Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization 1.169936 3
assign1 Robert Fourer Imported from the MIPLIB2010 submissions. 1.179187 4
f2gap Salim Haddadi Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.209185 5