×
![]()
map
| Type: | Model Group |
| Submitter: | Kiyan Ahmadizadeh |
| Description: | Land parcel selection problems motivated by Red-Cockaded Woodpecker conservation problem |
Parent Model Group (map)
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 | map14860-20 |
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 | rmatr | polygonpack | sp_product | n37 | allcolor | |
|
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.455 | 2 / 0.682 | 3 / 0.879 | 4 / 0.899 | 5 / 0.984 |
Model Group Summary
The table below contains summary information for map, and for the five most similar model groups to map according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Model Group | map | Kiyan Ahmadizadeh | Land parcel selection problems motivated by Red-Cockaded Woodpecker conservation problem | 0.000000 | - |
| MIC Top 5 | rmatr | Dmitry Krushinsky | Model coming from a formulation of the p-Median problem using square cost matrices | 0.454718 | 1 |
| 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.682389 | 2 | |
| sp_product | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 0.879077 | 3 | |
| n37 | J. Aronson | Fixed charge transportation problem | 0.898835 | 4 | |
| allcolor | Domenico Salvagnin | Prepack optimization model. | 0.984166 | 5 |
