×
![]()
selofsubspaces
| Type: | Model Group |
| Submitter: | Daniel Heinlein |
| Description: | Clique problems arising from a selection problem of subspaces in the PG(7,2) with different prescribed variables and numerically instable linear programming relaxation. |
Parent Model Group (selofsubspaces)
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. |
These are component instance images.
|
 |
 |
|
|
|
| Name | a2864-99blp |
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-23 | 2hopcds | neos-pseudoapplication-103 | iis | bppc | |
|
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.554 | 2 / 1.672 | 3 / 1.686 | 4 / 1.708 | 5 / 1.792 |
Model Group Summary
The table below contains summary information for selofsubspaces, and for the five most similar model groups to selofsubspaces according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Model Group | selofsubspaces | Daniel Heinlein | Clique problems arising from a selection problem of subspaces in the PG(7,2) with different prescribed variables and numerically instable linear programming relaxation. | 0.000000 | - |
| MIC Top 5 | neos-pseudoapplication-23 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.553601 | 1 |
| 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.672127 | 2 | |
| neos-pseudoapplication-103 | Hans Mittelmann | Collection of anonymous submissions to the NEOS Server for Optimization | 1.685859 | 3 | |
| 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.707676 | 4 | |
| bppc | Manuel Iori | The models that we attach solve the "bar-relaxation", also known as the "Bin Packing Problem with Contiguity" or the "P||Cmax with contiguity". This is one of the most interesting relaxations for two dimensional cutting and packing problems. Its solution by means of an ILP software is the bottleneck of the primal decomposition methods that we attempted in the paper cited below. In detail, the files correspond to model (12)-(15) in the paper, applied to the models of the Classes 4, 6 and 8 by Martello and Vigo (Management Science, 1998). | 1.791510 | 5 |
