physiciansched

Type: Model Group
Submitter: Pelin Damci-Kurt
Description: Physician scheduling problem for hospitalist, radiology and kidney specialist groups.

Parent Model Group (physiciansched)

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

Model group: physiciansched
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: physiciansched3-4 Component instance: physiciansched3-3 Component instance: physiciansched5-3 Component instance: physiciansched6-1 Component instance: physiciansched6-2
Name physiciansched3-4 physiciansched3-3 physiciansched5-3 physiciansched6-1 physiciansched6-2

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: sct Model group: 2hopcds Model group: neos-pseudoapplication-87 Model group: neos-pseudoapplication-106 Model group: neos-pseudoapplication-66
Name sct 2hopcds neos-pseudoapplication-87 neos-pseudoapplication-106 neos-pseudoapplication-66
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.914 2 / 2.080 3 / 2.104 4 / 2.117 5 / 2.130

Model Group Summary

The table below contains summary information for physiciansched, and for the five most similar model groups to physiciansched according to the MIC.

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
Parent Model Group physiciansched Pelin Damci-Kurt Physician scheduling problem for hospitalist, radiology and kidney specialist groups. 0.000000 -
MIC Top 5 sct Siemens Assembly line balancing for printed circuit board production. First solved by Gurobi 7.0 in 65 hours (32 threads). 1.913676 1
2hopcds Austin Buchanan A problem in wireless networks. The objective is to select a minimum number of relay nodes so that any two nonadjacent nodes can communicate by way of the chosen relay nodes in at most s hops, where s is a problem input. The 2-hop case of this problem can be formulated as a set cover/hitting set problem with n binary variables and n^2 constraints: _{ k N(i) N(j) } x_k 1 for nonadjacent node pairs {i,j}. Despite the formulation's simplicity, models with as few as 120 variables are left unsolved after one hour using Gurobi 7.0.2. 2.080294 2
neos-pseudoapplication-87 NEOS Server Submission Imported from the MIPLIB2010 submissions. 2.104321 3
neos-pseudoapplication-106 Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization 2.116529 4
neos-pseudoapplication-66 NEOS Server Submission Imported from the MIPLIB2010 submissions. 2.130489 5


Updated August 19, 2019