×
![]()
control
| Type: | Model Group |
| Submitter: | Qie He |
| Description: | Optimal control of a discrete-time switched system model Numerically challenging. Different solvers report this model as solved to optimality, infeasible, or unbounded. |
Parent Model Group (control)
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 | control30-3-2-3 | control30-5-10-4 | control20-5-10-5 |
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 | nxy-z | aflow | beasley | noip | neos-pseudoapplication-75 | |
|
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.197 | 2 / 1.250 | 3 / 1.333 | 4 / 1.363 | 5 / 1.386 |
Model Group Summary
The table below contains summary information for control, and for the five most similar model groups to control according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Model Group | control | Qie He | Optimal control of a discrete-time switched system model Numerically challenging. Different solvers report this model as solved to optimality, infeasible, or unbounded. | 0.000000 | - |
| MIC Top 5 | nxy-z | A. Atamtürk | Capacitated network design problem | 1.197367 | 1 |
| aflow | T. Achterberg | Arborescence flow problem on a graph with 40 nodes and edge density 0.9 | 1.249735 | 2 | |
| beasley | F. Ortega, L. Wolsey | Fixed cost network flow problems | 1.333396 | 3 | |
| noip | Christopher Hojny | integer programming formulation that verifies that no integer programming formulation of a given 0/1-point set exists | 1.362554 | 4 | |
| neos-pseudoapplication-75 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.386008 | 5 |
