×
![]()
pigeon
| Type: | Model Group |
| Submitter: | Sam Allen |
| Description: | Model of 3D packing (container loading) problem |
Parent Model Group (pigeon)
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.
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-32 | satellites | neos-pseudoapplication-40 | pb- | neos-pseudoapplication-35 | |
|
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.926 | 2 / 2.077 | 3 / 2.155 | 4 / 2.203 | 5 / 2.227 |
Model Group Summary
The table below contains summary information for pigeon, and for the five most similar model groups to pigeon according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Model Group | pigeon | Sam Allen | Model of 3D packing (container loading) problem | 0.000000 | - |
| MIC Top 5 | neos-pseudoapplication-32 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.926473 | 1 |
| satellites | He Renjie | Ihe attachment is some models generated from real life satelliteschedule problem data,these models are easier comparable to real lifeproblem. The work is done by me and Alberto Ceselli from Univeristy ofMilano. I donnot know it is hard enough or not, if needs , I can generatemore difficult models. | 2.077457 | 2 | |
| neos-pseudoapplication-40 | Jeff Linderoth | (None provided) | 2.154846 | 3 | |
| pb- | Gleb Belov | These are the models from MiniZinc Challenges 2012-2016 (see www.minizinc.org), compiled for MIP WITH INDICATOR CONSTRAINTS using the develop branch of MiniZinc and CPLEX 12.7.1 on 30 April 2017. Thus, these models can only be handled by solvers accepting indicator constraints. For models compiled with big-M/domain decomposition only, see my previous submission to MIPLIB.To recompile, create a directory MODELS, a list lst12_16.txt of the models with full paths to mzn/dzn files of each model per line, and say$> ~/install/libmzn/tests/benchmarking/mzn-test.py -l ../lst12_16.txt -slvPrf MZN-CPLEX -debug 1 -addOption "-timeout 3 -D fIndConstr=true -D fMIPdomains=false" -useJoinedName "-writeModel MODELS_IND/%s.mps" Alternatively, you can compile individual model as follows: $> mzn-cplex -v -s -G linear -output-time ../challenge_2012_2016/mznc2016_probs/zephyrus/zephyrus.mzn ../challenge_2012_2016/mznc2016_p/zephyrus/14__8__6__3.dzn -a -timeout 3 -D fIndConstr=true -D fMIPdomains=false -writeModel MODELS_IND/challenge_2012_2016mznc2016_probszephyruszephyrusmzn-challenge_2012_2016mznc2016_probszephyrus14__8__6__3dzn.mps | 2.203200 | 4 | |
| neos-pseudoapplication-35 | Jeff Linderoth | (None provided) | 2.227458 | 5 |
