×
![]()
neos-pseudoapplication-27
| Type: | Model Group |
| Submitter: | NEOS Server Submission |
| Description: | Imported from the MIPLIB2010 submissions. |
Parent Model Group (neos-pseudoapplication-27)
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 | neos22 |
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 | sing | graphs | polygonpack | n37 | radiation | |
|
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 / 0.737 | 2 / 0.749 | 3 / 0.865 | 4 / 0.876 | 5 / 0.938 |
Model Group Summary
The table below contains summary information for neos-pseudoapplication-27, and for the five most similar model groups to neos-pseudoapplication-27 according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Model Group | neos-pseudoapplication-27 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 0.000000 | - |
| MIC Top 5 | sing | Daniel Espinoza | Imported from the MIPLIB2010 submissions. | 0.737112 | 1 |
| graphs | Michael Bastubbe | Packing Cuts in Undirected Graphs. Models are described in 4.1. | 0.749482 | 2 | |
| polygonpack | Antonio Frangioni | Given a set P of polygons, not necessarily convex, and a rectangle, we want to find the subset S of P with largest possible total area and a position every p in S so that there are no overlaps and they are all included in the rectangle. We allow a small set of rotations (0, 90, 180, 270 degrees) for every polygon. The problem is simplified w.r.t. the real application because the polygons do not have (fully encircled) "holes", which are supposedly filled-in separately, although they can have "bays". Models are saved as .lp. Model LpPackingModel_Dim means that we are trying to pack polygons taken from set ; there are currently 5 different sets, and is 7, 10 or 15. | 0.865130 | 3 | |
| n37 | J. Aronson | Fixed charge transportation problem | 0.875915 | 4 | |
| radiation | Gleb Belov | Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 | 0.937906 | 5 |
