×
![]()
polygonpack
| Type: | Model Group |
| Submitter: | Antonio Frangioni |
| Description: | 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. |
Parent Model Group (polygonpack)
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 | polygonpack4-10 | polygonpack4-15 | polygonpack5-15 | polygonpack4-7 |
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 | map | neos-pseudoapplication-27 | graphs | n37 | |
|
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.604 | 2 / 0.682 | 3 / 0.865 | 4 / 0.926 | 5 / 0.940 |
Model Group Summary
The table below contains summary information for polygonpack, and for the five most similar model groups to polygonpack according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Model Group | 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.000000 | - |
| MIC Top 5 | rmatr | Dmitry Krushinsky | Model coming from a formulation of the p-Median problem using square cost matrices | 0.604149 | 1 |
| map | Kiyan Ahmadizadeh | Land parcel selection problems motivated by Red-Cockaded Woodpecker conservation problem | 0.682389 | 2 | |
| neos-pseudoapplication-27 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 0.865130 | 3 | |
| graphs | Michael Bastubbe | Packing Cuts in Undirected Graphs. Models are described in 4.1. | 0.925764 | 4 | |
| n37 | J. Aronson | Fixed charge transportation problem | 0.939590 | 5 |
