neos-pseudoapplication-50

Type: Model Group
Submitter: NEOS Server Submission
Description: Model coming from the NEOS Server with unknown application

Parent Model Group (neos-pseudoapplication-50)

All other model groups below were be compared against this "query" model group.

Model group: neos-pseudoapplication-50
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.
Component instance: neos-3075395-nile Component instance: neos-3072252-nete Component instance: neos-520729
Name neos-3075395-nile neos-3072252-nete neos-520729

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.
Model group: set3 Model group: neos-pseudoapplication-40 Model group: neos-pseudoapplication-97 Model group: allcolor Model group: scp
Name set3 neos-pseudoapplication-40 neos-pseudoapplication-97 allcolor scp
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.705 2 / 1.733 3 / 1.759 4 / 1.763 5 / 1.787

Model Group Summary

The table below contains summary information for neos-pseudoapplication-50, and for the five most similar model groups to neos-pseudoapplication-50 according to the MIC.

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
Parent Model Group neos-pseudoapplication-50 NEOS Server Submission Model coming from the NEOS Server with unknown application 0.000000 -
MIC Top 5 set3 Kerem Akartunali Multi-item lot-sizing with backlogging. Solved by SCIP 3.1.1 parallelized by UG 0.7.5 linked to CPLEX 12.6 as an LP solver on HLRN III (https://www.hlrn.de/home/view/System3/CrayHardware). Due to time limit restrictions, four repeated runs, each starting from the checkpointing file of the previous run, were done. Each run had a time limit of 12 hours while using 6144 (runs 1) or 3072 cores (run 2 - 4). 1.704700 1
neos-pseudoapplication-40 Jeff Linderoth (None provided) 1.733405 2
neos-pseudoapplication-97 Jeff Linderoth (None provided) 1.759308 3
allcolor Domenico Salvagnin Prepack optimization model. 1.762883 4
scp Shunji Umetani This is a random test model generator for SCP using the scheme of the following paper, namely the column cost c[j] are integer randomly generated from [1,100]; every column covers at least one row; and every row is covered by at least two columns. see reference: E. Balas and A. Ho, Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study, Mathematical Programming, 12 (1980), 37-60. We have newly generated Classes I-N with the following parameter values, where each class has five models. We have also generated reduced models by a standard pricing method in the following paper: S. Umetani and M. Yagiura, Relaxation heuristics for the set covering problem, Journal of the Operations Research Society of Japan, 50 (2007), 350-375. You can obtain the model generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark 1.786541 5