triptim

Type: Model Group
Submitter: MIPLIB submission pool
Description: Imported from the MIPLIB2010 submissions.

Parent Model Group (triptim)

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

Model group: triptim
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: triptim8 Component instance: triptim2 Component instance: triptim1 Component instance: triptim4
Name triptim8 triptim2 triptim1 triptim4

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: f2gap Model group: independentset Model group: 2hopcds Model group: generated Model group: mod
Name f2gap independentset 2hopcds generated mod
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 / 2.059 2 / 2.079 3 / 2.114 4 / 2.126 5 / 2.128

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
Parent Model Group triptim MIPLIB submission pool Imported from the MIPLIB2010 submissions. 0.000000 -
MIC Top 5 f2gap Salim Haddadi Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 2.058543 1
independentset Toni Sorrell These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. 2.079023 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. 2.113759 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. 2.125927 4
mod MIPLIB submission pool Imported from the MIPLIB2010 submissions. 2.127727 5


Updated August 19, 2019