×
![]()
fhnw-schedule-paira200: Instance-to-Instance Comparison Results
| Type: | Instance |
| Submitter: | Simon Felix |
| Description: | Continuous-time project scheduling and selection, inspired by an industry use-case. Each project has a value, the sum should be maximized. Each project has a deadline, and an earliest start date. Three formulations of the same problem ("Pair A", "Pair B" and "Slot") - we expect "Pair B" to be the best formulation. |
| MIPLIB Entry |
Parent Instance (fhnw-schedule-paira200)
All other instances below were be compared against this "query" instance.  |
 |
 |
 |
 |
 |
|
Raw
This is the CCM image before the decomposition procedure has been applied.
|
Decomposed
This is the CCM image after a decomposition procedure has been applied. This is the image used by the MIC's image-based comparisons for this query instance.
|
Composite of MIC Top 5
Composite of the five decomposed CCM images from the MIC Top 5.
|
Composite of MIPLIB Top 5
Composite of the five decomposed CCM images from the MIPLIB Top 5.
|
Model Group Composite Image
Composite of the decomposed CCM images for every instance in the same model group as this query.
|
MIC Top 5 Instances
These are the 5 decomposed CCM images that are most similar to decomposed CCM image for the the query instance, according to the ISS metric. |
Decomposed
These decomposed images were created by GCG.
|
 |
 |
 |
 |
 |
| Name | fhnw-schedule-paira100 [MIPLIB] | tanglegram4 [MIPLIB] | fhnw-schedule-paira400 [MIPLIB] | polygonpack4-10 [MIPLIB] | probportfolio [MIPLIB] | |
|
Rank / ISS
The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query instance and all other instances. A smaller ISS value indicates greater similarity.
|
1 / 0.266 | 2 / 0.298 | 3 / 0.316 | 4 / 0.501 | 5 / 0.504 | |
|
Raw
These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
|
 |
 |
 |
 |
 |
MIPLIB Top 5 Instances
These are the 5 instances that are most closely related to the query instance, according to the instance statistic-based similarity measure employed by MIPLIB 2017 |
Decomposed
These decomposed images were created by GCG.
|
 |
 |
 |
 |
 |
| Name | fhnw-schedule-paira100 [MIPLIB] | fhnw-schedule-paira400 [MIPLIB] | neos-5115478-kaveri [MIPLIB] | pg [MIPLIB] | nh97_potential [MIPLIB] | |
|
Rank / ISS
The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query instance and all model groups. A smaller ISS value indicates greater similarity.
|
1 / 0.266 | 3 / 0.316 | 154 / 1.074 | 288 / 1.293 | 366 / 1.384 | |
|
Raw
These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
|
|
|
 |
 |
 |
Instance Summary
The table below contains summary information for fhnw-schedule-paira200, the five most similar instances to fhnw-schedule-paira200 according to the MIC, and the five most similar instances to fhnw-schedule-paira200 according to MIPLIB 2017.
| INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Instance | fhnw-schedule-paira200 [MIPLIB] | Simon Felix | Continuous-time project scheduling and selection, inspired by an industry use-case. Each project has a value, the sum should be maximized. Each project has a deadline, and an earliest start date. Three formulations of the same problem ("Pair A", "Pair B" and "Slot") - we expect "Pair B" to be the best formulation. | 0.000000 | - |
| MIC Top 5 | fhnw-schedule-paira100 [MIPLIB] | Simon Felix | Continuous-time project scheduling and selection, inspired by an industry use-case. Each project has a value, the sum should be maximized. Each project has a deadline, and an earliest start date. Three formulations of the same problem ("Pair A", "Pair B" and "Slot") - we expect "Pair B" to be the best formulation. | 0.265925 | 1 |
| tanglegram4 [MIPLIB] | Falk Hueffner | The NP-hard Balanced Subgraph problem (variant of MaxCut) encoded as ILPs. Real-world instances from two applications from bioinformatics, finding monotone subsystems in gene regulatory networks (http://dx.doi.org/10.1007/s10878-009-9212-2) and finding optimal layouts of tanglegrams (http://dx.doi.org/10.1007/978-3-642-11269-0). | 0.298348 | 2 | |
| fhnw-schedule-paira400 [MIPLIB] | Simon Felix | Continuous-time project scheduling and selection, inspired by an industry use-case. Each project has a value, the sum should be maximized. Each project has a deadline, and an earliest start date. Three formulations of the same problem ("Pair A", "Pair B" and "Slot") - we expect "Pair B" to be the best formulation. | 0.316423 | 3 | |
| polygonpack4-10 [MIPLIB] | 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. Instance 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.501463 | 4 | |
| probportfolio [MIPLIB] | Feng Qiu | Sample average approximation formulation of a probabilistic portfolio optimization problem. Solved using ug[SCIP/spx], a distributed massively parallel version of SCIP run on 2,000 cores at the HLRN-II super computer facility. | 0.504197 | 5 | |
| MIPLIB Top 5 | fhnw-schedule-paira100 [MIPLIB] | Simon Felix | Continuous-time project scheduling and selection, inspired by an industry use-case. Each project has a value, the sum should be maximized. Each project has a deadline, and an earliest start date. Three formulations of the same problem ("Pair A", "Pair B" and "Slot") - we expect "Pair B" to be the best formulation. | 0.265925 | 1 |
| fhnw-schedule-paira400 [MIPLIB] | Simon Felix | Continuous-time project scheduling and selection, inspired by an industry use-case. Each project has a value, the sum should be maximized. Each project has a deadline, and an earliest start date. Three formulations of the same problem ("Pair A", "Pair B" and "Slot") - we expect "Pair B" to be the best formulation. | 0.316423 | 3 | |
| neos-5115478-kaveri [MIPLIB] | Jeff Linderoth | (None provided) | 1.073611 | 154 | |
| pg [MIPLIB] | M. Dawande | Multiproduct partial shipment model | 1.292828 | 288 | |
| nh97_potential [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.384485 | 366 |
fhnw-schedule-paira200: Instance-to-Model Comparison Results
| Model Group Assignment from MIPLIB: | schedule |
| Assigned Model Group Rank/ISS in the MIC: | 32 / 1.726 |
MIC Top 5 Model Groups
These are the 5 model group composite (MGC) images that are most similar to the decomposed CCM image for the query instance, according to the ISS metric. |
These are model group composite (MGC) images for the MIC top 5 model groups.
|
 |
 |
 |
 |
 |
| Name | map | polygonpack | rmatr | sp_product | n37 | |
|
Rank / ISS
The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query instance and all other instances. A smaller ISS value indicates greater similarity.
|
1 / 0.809 | 2 / 0.841 | 3 / 0.866 | 4 / 1.077 | 5 / 1.116 |
Model Group Summary
The table below contains summary information for the five most similar model groups to fhnw-schedule-paira200 according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| MIC Top 5 | map | Kiyan Ahmadizadeh | Land parcel selection problems motivated by Red-Cockaded Woodpecker conservation problem | 0.809460 | 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.840564 | 2 | |
| rmatr | Dmitry Krushinsky | Model coming from a formulation of the p-Median problem using square cost matrices | 0.866012 | 3 | |
| sp_product | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.077424 | 4 | |
| n37 | J. Aronson | Fixed charge transportation problem | 1.116346 | 5 |
