Instances

This page contains a list of the 992 MIP instances from MIPLIB 2017 which are considered in this analysis, referred to as the MIPLIB Image Comparison (MIC). For each instance the submitter, description, and model group assignment are provided. Note that a dash in the MODEL GROUP column implies that an instance was not assigned to any model group in MIPLIB 2017.

Raw and decomposed constraint coefficient matrix (CCM) images are also presented for each instance. The initial (raw) ordering of rows and columns for a CCM is determined by the order in which constraints and variables, respectively, were defined by the instance developer. For the instances in MIPLIB, defined CCM structures were rarely apparent in this raw form. As such, the rows and columns of each CCM were rearranged such that clear patterns are apparent in layout of nonzero matrix entries. This process, referred to as decomposition, was conducted using the generalized column generation (GCG) functionality in SCIP, an optimization software. Note that comparisons in the MIC were made between decomposed CCM images.

To view a summary of the MIC results for a particular instance, click on that instance's name. There is also a link next to each instance name which will redirect you to the corresponding instance page in MIPLIB 2017.

Instances in MIPLIB 2017 which are excluded from the MIC

No available decomposition

There are 33 instances for which GCG detected no decomposition. CCMs with no discernible structure are not the focus of this analysis, as they are unlikely to share structural similarities with other MIP instances. As such, these instances were excluded from the MIC.

INSTANCE
bc [MIPLIB]
bley_xl1 [MIPLIB]
bley_xs1 [MIPLIB]
bley_xs1noM [MIPLIB]
bley_xs2 [MIPLIB]
dlr1 [MIPLIB]
dlr2 [MIPLIB]
ej [MIPLIB]
gfd-schedulen180f7d50m30k18-16i [MIPLIB]
hawaiiv10-130 [MIPLIB]
in [MIPLIB]
ivu06-big [MIPLIB]
ivu59 [MIPLIB]
kottenpark09 [MIPLIB]
neos-3208254-reiu [MIPLIB]
neos-3229051-yass [MIPLIB]
neos-3230511-yuna [MIPLIB]
neos-3354841-apure [MIPLIB]
neos-3402454-bohle [MIPLIB]
neos-3740487-motru [MIPLIB]
neos-4285819-pedja [MIPLIB]
neos-4332801-seret [MIPLIB]
neos-4332810-sesia [MIPLIB]
neos-4535459-waipa [MIPLIB]
ns1690781 [MIPLIB]
nucorsav [MIPLIB]
rfds-4-days [MIPLIB]
rmine25 [MIPLIB]
splan1 [MIPLIB]
supportcase11 [MIPLIB]
supportcase38 [MIPLIB]
uc720-7-4-4-8 [MIPLIB]
usafa [MIPLIB]

Duplicates of other instances in the collection

There are 40 pairs of instances from MIPLIB which have identical CCM images. In each case, both instances come from the same model group. We suggest that identifying identical MIP instances from a single model group would not be an interesting result. For each pair, then, one of the duplicate images was excluded from the MIC.

INSTANCE DUPLICATED BY
adult-regularized [MIPLIB] adult-max5features [MIPLIB]
b1c1s1 [MIPLIB] b2c1s1 [MIPLIB]
bmocbd3 [MIPLIB] bmocbd2 [MIPLIB]
drayage-100-12 [MIPLIB] drayage-100-23 [MIPLIB]
drayage-25-23 [MIPLIB] drayage-100-23 [MIPLIB]
drayage-25-27 [MIPLIB] drayage-100-23 [MIPLIB]
drayage-25-32 [MIPLIB] drayage-100-23 [MIPLIB]
ger50-17-ptp-pop-3t [MIPLIB] ger50-17-ptp-pop-6t [MIPLIB]
ger50-17-trans-pop-3t [MIPLIB] ger50_17_trans [MIPLIB]
gsvm2rl11 [MIPLIB] gsvm2rl12 [MIPLIB]
map06 [MIPLIB] map14860-20 [MIPLIB]
map10 [MIPLIB] map14860-20 [MIPLIB]
map16715-04 [MIPLIB] map14860-20 [MIPLIB]
map18 [MIPLIB] map14860-20 [MIPLIB]
mc11 [MIPLIB] mc8 [MIPLIB]
mc7 [MIPLIB] mc8 [MIPLIB]
mik-250-20-75-1 [MIPLIB] mik-250-20-75-5 [MIPLIB]
mik-250-20-75-2 [MIPLIB] mik-250-20-75-5 [MIPLIB]
mik-250-20-75-3 [MIPLIB] mik-250-20-75-5 [MIPLIB]
mik-250-20-75-4 [MIPLIB] mik-250-20-75-5 [MIPLIB]
n3700 [MIPLIB] n3707 [MIPLIB]
n3705 [MIPLIB] n3707 [MIPLIB]
n3709 [MIPLIB] n3707 [MIPLIB]
n370b [MIPLIB] n3707 [MIPLIB]
neos-4387871-tavua [MIPLIB] neos-4393408-tinui [MIPLIB]
neos-4763324-toguru [MIPLIB] neos-4760493-puerua [MIPLIB]
neos-5107597-kakapo [MIPLIB] neos-5115478-kaveri [MIPLIB]
neos-5195221-niemur [MIPLIB] neos-5193246-nerang [MIPLIB]
no-ip-65059 [MIPLIB] no-ip-64999 [MIPLIB]
nu120-pr9 [MIPLIB] nu4-pr9 [MIPLIB]
nu25-pr12 [MIPLIB] nu120-pr12 [MIPLIB]
p500x2988c [MIPLIB] p500x2988d [MIPLIB]
polygonpack3-15 [MIPLIB] polygonpack4-15 [MIPLIB]
satellites2-40 [MIPLIB] satellites2-25 [MIPLIB]
scpn2 [MIPLIB] scpm1 [MIPLIB]
set3-09 [MIPLIB] set3-20 [MIPLIB]
set3-10 [MIPLIB] set3-20 [MIPLIB]
set3-15 [MIPLIB] set3-20 [MIPLIB]
set3-16 [MIPLIB] set3-20 [MIPLIB]
triptim7 [MIPLIB] triptim8 [MIPLIB]

Available Instances

Zeros are Black Zeros are White
INSTANCE SUBMITTER DESCRIPTION MODEL GROUP RAW DECOMPOSED RAW DECOMPOSED
1 22433 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - 22433 raw, zeros are black 22433 decomposed, zeros are black 22433 raw, zeros are white 22433 decomposed, zeros are white
2 23588 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - 23588 raw, zeros are black 23588 decomposed, zeros are black 23588 raw, zeros are white 23588 decomposed, zeros are white
3 10teams [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - 10teams raw, zeros are black 10teams decomposed, zeros are black 10teams raw, zeros are white 10teams decomposed, zeros are white
4 2club200v15p5scn [MIPLIB] Balabhaskar Balasundaram Maximum 2-club instance; graph; clique relaxations Solved with Gurobi 8.1 on 24 cores in approx. 23 hours. - 2club200v15p5scn raw, zeros are black 2club200v15p5scn decomposed, zeros are black 2club200v15p5scn raw, zeros are white 2club200v15p5scn decomposed, zeros are white
5 30_70_45_05_100 [MIPLIB] J. Walser Geographic radar station allocation 30_70 30_70_45_05_100 raw, zeros are black 30_70_45_05_100 decomposed, zeros are black 30_70_45_05_100 raw, zeros are white 30_70_45_05_100 decomposed, zeros are white
6 30_70_45_095_100 [MIPLIB] J. Walser Geographic radar station allocation 30_70 30_70_45_095_100 raw, zeros are black 30_70_45_095_100 decomposed, zeros are black 30_70_45_095_100 raw, zeros are white 30_70_45_095_100 decomposed, zeros are white
7 30_70_45_095_98 [MIPLIB] J. Walser Geographic radar station allocation 30_70 30_70_45_095_98 raw, zeros are black 30_70_45_095_98 decomposed, zeros are black 30_70_45_095_98 raw, zeros are white 30_70_45_095_98 decomposed, zeros are white
8 30n20b8 [MIPLIB] E. Coughlan, M. Lübbecke, J. Schulz Multi-mode resource leveling with availability constraint - 30n20b8 raw, zeros are black 30n20b8 decomposed, zeros are black 30n20b8 raw, zeros are white 30n20b8 decomposed, zeros are white
9 50v-10 [MIPLIB] Serge Bisaillon Network loading instance. Solved using ug[SCIP/spx], a distributed massively parallel version of SCIP run on 2,000 cores at the HLRN-II super computer facility. - 50v-10 raw, zeros are black 50v-10 decomposed, zeros are black 50v-10 raw, zeros are white 50v-10 decomposed, zeros are white
10 8div-n59k10 [MIPLIB] Sascha Kurz Projective binary 8-divisible linear block codes A linear block code is called 8-divisible if the weights of its codewords are divisible by 8. It is called projective if there are no duplicate columns in the generator matrix. The possible lengths of 8-divisible linear block codes have been classified except for length n=59, where it is undecided whether such a linear code exists. The possible dimensions satisfy \\(10 \\le k \\le 20\\). Instance 8div_n59_kXX contains the corresponding feasibility problem. Projective binary 8-divisible linear block codes occur as hole configurations of so-called partial solid spreads in finite geometry. Binary 4-divisible linear block codes have applications in physics. 8div 8div-n59k10 raw, zeros are black 8div-n59k10 decomposed, zeros are black 8div-n59k10 raw, zeros are white 8div-n59k10 decomposed, zeros are white
11 8div-n59k11 [MIPLIB] Sascha Kurz Projective binary 8-divisible linear block codes A linear block code is called 8-divisible if the weights of its codewords are divisible by 8. It is called projective if there are no duplicate columns in the generator matrix. The possible lengths of 8-divisible linear block codes have been classified except for length n=59, where it is undecided whether such a linear code exists. The possible dimensions satisfy \\(10 \\le k \\le 20\\). Instance 8div_n59_kXX contains the corresponding feasibility problem. Projective binary 8-divisible linear block codes occur as hole configurations of so-called partial solid spreads in finite geometry. Binary 4-divisible linear block codes have applications in physics. 8div 8div-n59k11 raw, zeros are black 8div-n59k11 decomposed, zeros are black 8div-n59k11 raw, zeros are white 8div-n59k11 decomposed, zeros are white
12 8div-n59k12 [MIPLIB] Sascha Kurz Projective binary 8-divisible linear block codes A linear block code is called 8-divisible if the weights of its codewords are divisible by 8. It is called projective if there are no duplicate columns in the generator matrix. The possible lengths of 8-divisible linear block codes have been classified except for length n=59, where it is undecided whether such a linear code exists. The possible dimensions satisfy \\(10 \\le k \\le 20\\). Instance 8div_n59_kXX contains the corresponding feasibility problem. Projective binary 8-divisible linear block codes occur as hole configurations of so-called partial solid spreads in finite geometry. Binary 4-divisible linear block codes have applications in physics. 8div 8div-n59k12 raw, zeros are black 8div-n59k12 decomposed, zeros are black 8div-n59k12 raw, zeros are white 8div-n59k12 decomposed, zeros are white
13 a1c1s1 [MIPLIB] M. Vyve, Y. Pochet Lot sizing instance. Alkis Vazacopoulos reports solving this instance using XPRESS 2006B. c1s1 a1c1s1 raw, zeros are black a1c1s1 decomposed, zeros are black a1c1s1 raw, zeros are white a1c1s1 decomposed, zeros are white
14 a2864-99blp [MIPLIB] Daniel Heinlein Clique problems arising from a selection problem of subspaces in the PG(7,2) with different prescribed variables and numerically instable linear programming relaxation. selofsubspaces a2864-99blp raw, zeros are black a2864-99blp decomposed, zeros are black a2864-99blp raw, zeros are white a2864-99blp decomposed, zeros are white
15 a2c1s1 [MIPLIB] M. Vyve, Y. Pochet Lot sizing instance. c1s1 a2c1s1 raw, zeros are black a2c1s1 decomposed, zeros are black a2c1s1 raw, zeros are white a2c1s1 decomposed, zeros are white
16 ab51-40-100 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. ab ab51-40-100 raw, zeros are black ab51-40-100 decomposed, zeros are black ab51-40-100 raw, zeros are white ab51-40-100 decomposed, zeros are white
17 ab67-40-100 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. ab ab67-40-100 raw, zeros are black ab67-40-100 decomposed, zeros are black ab67-40-100 raw, zeros are white ab67-40-100 decomposed, zeros are white
18 ab69-40-100 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. ab ab69-40-100 raw, zeros are black ab69-40-100 decomposed, zeros are black ab69-40-100 raw, zeros are white ab69-40-100 decomposed, zeros are white
19 ab71-20-100 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. ab ab71-20-100 raw, zeros are black ab71-20-100 decomposed, zeros are black ab71-20-100 raw, zeros are white ab71-20-100 decomposed, zeros are white
20 ab72-40-100 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. ab ab72-40-100 raw, zeros are black ab72-40-100 decomposed, zeros are black ab72-40-100 raw, zeros are white ab72-40-100 decomposed, zeros are white
21 academictimetablebig [MIPLIB] Joshua Friedman Academic timetabling integer program Reported solved after 1 1/2 days using Gurobi. - academictimetablebig raw, zeros are black academictimetablebig decomposed, zeros are black academictimetablebig raw, zeros are white academictimetablebig decomposed, zeros are white
22 academictimetablesmall [MIPLIB] Joshua Friedman Academic timetabling integer program - academictimetablesmall raw, zeros are black academictimetablesmall decomposed, zeros are black academictimetablesmall raw, zeros are white academictimetablesmall decomposed, zeros are white
23 acc-tight2 [MIPLIB] J. Walser ACC basketball scheduling instance acc-tight acc-tight2 raw, zeros are black acc-tight2 decomposed, zeros are black acc-tight2 raw, zeros are white acc-tight2 decomposed, zeros are white
24 acc-tight4 [MIPLIB] J. Walser ACC basketball scheduling instance acc-tight acc-tight4 raw, zeros are black acc-tight4 decomposed, zeros are black acc-tight4 raw, zeros are white acc-tight4 decomposed, zeros are white
25 acc-tight5 [MIPLIB] J. Walser ACC basketball scheduling instance acc-tight acc-tight5 raw, zeros are black acc-tight5 decomposed, zeros are black acc-tight5 raw, zeros are white acc-tight5 decomposed, zeros are white
26 adult-max5features [MIPLIB] Berk Ustun MIP to create optimized data-driven scoring systems. See: https://github.com/ustunb/miplib2017-slim#miplib2017-slim for a description. ustun adult-max5features raw, zeros are black adult-max5features decomposed, zeros are black adult-max5features raw, zeros are white adult-max5features decomposed, zeros are white
27 aflow30a [MIPLIB] T. Achterberg Arborescence flow problem aflow aflow30a raw, zeros are black aflow30a decomposed, zeros are black aflow30a raw, zeros are white aflow30a decomposed, zeros are white
28 aflow40b [MIPLIB] T. Achterberg Arborescence flow problem on a graph with 40 nodes and edge density 0.9 aflow aflow40b raw, zeros are black aflow40b decomposed, zeros are black aflow40b raw, zeros are white aflow40b decomposed, zeros are white
29 air03 [MIPLIB] G. Astfalk Airline crew scheduling set partitioning problem air air03 raw, zeros are black air03 decomposed, zeros are black air03 raw, zeros are white air03 decomposed, zeros are white
30 air04 [MIPLIB] G. Astfalk Airline crew scheduling set partitioning problem air air04 raw, zeros are black air04 decomposed, zeros are black air04 raw, zeros are white air04 decomposed, zeros are white
31 air05 [MIPLIB] G. Astfalk Airline crew scheduling set partitioning problem air air05 raw, zeros are black air05 decomposed, zeros are black air05 raw, zeros are white air05 decomposed, zeros are white
32 aligninq [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - aligninq raw, zeros are black aligninq decomposed, zeros are black aligninq raw, zeros are white aligninq decomposed, zeros are white
33 allcolor10 [MIPLIB] Domenico Salvagnin Prepack optimization instance. allcolor allcolor10 raw, zeros are black allcolor10 decomposed, zeros are black allcolor10 raw, zeros are white allcolor10 decomposed, zeros are white
34 allcolor58 [MIPLIB] Domenico Salvagnin Prepack optimization model. allcolor allcolor58 raw, zeros are black allcolor58 decomposed, zeros are black allcolor58 raw, zeros are white allcolor58 decomposed, zeros are white
35 amaze22012-03-15i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 amaze amaze22012-03-15i raw, zeros are black amaze22012-03-15i decomposed, zeros are black amaze22012-03-15i raw, zeros are white amaze22012-03-15i decomposed, zeros are white
36 amaze22012-06-28i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 amaze amaze22012-06-28i raw, zeros are black amaze22012-06-28i decomposed, zeros are black amaze22012-06-28i raw, zeros are white amaze22012-06-28i decomposed, zeros are white
37 amaze22012-07-04i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 amaze amaze22012-07-04i raw, zeros are black amaze22012-07-04i decomposed, zeros are black amaze22012-07-04i raw, zeros are white amaze22012-07-04i decomposed, zeros are white
38 app1-1 [MIPLIB] Emilie Danna The archive contains 5 instances coming from 3 applications.app1 is interesting because the continuous variables (w) drive the model.Some solvers have numerical problems on app2 models: some solutions found violate the constraints by a small amount.app2 and app3 models are easy to solve. But they don't solve fast enough for the time limit I have in mind so I'd like to propose them for inclusion in MIPLIB. app app1-1 raw, zeros are black app1-1 decomposed, zeros are black app1-1 raw, zeros are white app1-1 decomposed, zeros are white
39 app1-2 [MIPLIB] Emilie Danna Undisclosed industrial application from Google app app1-2 raw, zeros are black app1-2 decomposed, zeros are black app1-2 raw, zeros are white app1-2 decomposed, zeros are white
40 app2-1 [MIPLIB] Emilie Danna The archive contains 5 instances coming from 3 applications.app1 is interesting because the continuous variables (w) drive the model.Some solvers have numerical problems on app2 models: some solutions found violate the constraints by a small amount.app2 and app3 models are easy to solve. But they don't solve fast enough for the time limit I have in mind so I'd like to propose them for inclusion in MIPLIB. app app2-1 raw, zeros are black app2-1 decomposed, zeros are black app2-1 raw, zeros are white app2-1 decomposed, zeros are white
41 app2-2 [MIPLIB] Emilie Danna The archive contains 5 instances coming from 3 applications.app1 is interesting because the continuous variables (w) drive the model.Some solvers have numerical problems on app2 models: some solutions found violate the constraints by a small amount.app2 and app3 models are easy to solve. But they don't solve fast enough for the time limit I have in mind so I'd like to propose them for inclusion in MIPLIB. app app2-2 raw, zeros are black app2-2 decomposed, zeros are black app2-2 raw, zeros are white app2-2 decomposed, zeros are white
42 app3 [MIPLIB] Emilie Danna The archive contains 5 instances coming from 3 applications.app1 is interesting because the continuous variables (w) drive the model.Some solvers have numerical problems on app2 models: some solutions found violate the constraints by a small amount.app2 and app3 models are easy to solve. But they don't solve fast enough for the time limit I have in mind so I'd like to propose them for inclusion in MIPLIB. app app3 raw, zeros are black app3 decomposed, zeros are black app3 raw, zeros are white app3 decomposed, zeros are white
43 arki001 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - arki001 raw, zeros are black arki001 decomposed, zeros are black arki001 raw, zeros are white arki001 decomposed, zeros are white
44 assign1-10-4 [MIPLIB] Robert Fourer Imported from the MIPLIB2010 submissions. assign1 assign1-10-4 raw, zeros are black assign1-10-4 decomposed, zeros are black assign1-10-4 raw, zeros are white assign1-10-4 decomposed, zeros are white
45 assign1-5-8 [MIPLIB] Robert Fourer Imported from the MIPLIB2010 submissions. assign1 assign1-5-8 raw, zeros are black assign1-5-8 decomposed, zeros are black assign1-5-8 raw, zeros are white assign1-5-8 decomposed, zeros are white
46 atlanta-ip [MIPLIB] E-Plus, D. Bienstock, A. Bley, R. Wessäly Min-cost network dimensioning problems with a finite set of link capacities for each bidirected link, unsplittable shortest path routing, path restoration for single node failures, and routing path length restrictions - atlanta-ip raw, zeros are black atlanta-ip decomposed, zeros are black atlanta-ip raw, zeros are white atlanta-ip decomposed, zeros are white
47 atm20-100 [MIPLIB] Matthew Galati ATM cash management problem. Solved with COIN/DIP in 1066 sec. (1 thread) / 259 sec. (8 threads) in June 2011. - atm20-100 raw, zeros are black atm20-100 decomposed, zeros are black atm20-100 raw, zeros are white atm20-100 decomposed, zeros are white
48 australia-abs-cta [MIPLIB] Jordi Castro Set of MILP instances of the CTA (Controlled Tabular Adjustment) problem, a method to protect statistical tabular data, belonging to the field of SDC (Statistical Disclosure Control). Raw data of instances are real or pseudo-real, provided by several National Statistical Agencies. We generated the CTA problem for these data. cta australia-abs-cta raw, zeros are black australia-abs-cta decomposed, zeros are black australia-abs-cta raw, zeros are white australia-abs-cta decomposed, zeros are white
49 b-ball [MIPLIB] Christopher Cullenbine It is a very simple problem, yet CPLEX will not close the MIPGAP. CPLEX seems to get stuck in a loop or something. - b-ball raw, zeros are black b-ball decomposed, zeros are black b-ball raw, zeros are white b-ball decomposed, zeros are white
50 b2c1s1 [MIPLIB] M. Vyve, Y. Pochet Lot sizing instance. Solved by Gurobi 4.6.1 (12 threads) in 116575 seconds (January 2012). c1s1 b2c1s1 raw, zeros are black b2c1s1 decomposed, zeros are black b2c1s1 raw, zeros are white b2c1s1 decomposed, zeros are white
51 bab1 [MIPLIB] Elmar Swarat, Laura Traverso, Julia Buwaya Integrated vehicle routing and crew scheduling of toll inspectors on German highways bab bab1 raw, zeros are black bab1 decomposed, zeros are black bab1 raw, zeros are white bab1 decomposed, zeros are white
52 bab2 [MIPLIB] Elmar Swarat Vehicle Routing with profits and an integrated crew scheduling formulated by two coupled multi-commodity flow problems. bab bab2 raw, zeros are black bab2 decomposed, zeros are black bab2 raw, zeros are white bab2 decomposed, zeros are white
53 bab3 [MIPLIB] Elmar Swarat Vehicle routing with profits and an integrated crew scheduling problem formulated by two coupled multi-commodity flow problems bab bab3 raw, zeros are black bab3 decomposed, zeros are black bab3 raw, zeros are white bab3 decomposed, zeros are white
54 bab5 [MIPLIB] Elmar Swarat Vehicle routing with profits and an integrated crew scheduling problem formulated by two coupled multi-commodity flow problems bab bab5 raw, zeros are black bab5 decomposed, zeros are black bab5 raw, zeros are white bab5 decomposed, zeros are white
55 bab6 [MIPLIB] Elmar Swarat Vehicle routing with profit and an integrated crew scheduling like bab2 - bab5. Instances differ in multi-commodity-flow formulation (path oder arc formulation) or time discretization and some are quite easy to solve while others (bab2, bab3 and bab6) are very difficult. bab bab6 raw, zeros are black bab6 decomposed, zeros are black bab6 raw, zeros are white bab6 decomposed, zeros are white
56 bc1 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. bc bc1 raw, zeros are black bc1 decomposed, zeros are black bc1 raw, zeros are white bc1 decomposed, zeros are white
57 beasleyC1 [MIPLIB] F. Ortega, L. Wolsey Fixed cost network flow problems beasley beasleyC1 raw, zeros are black beasleyC1 decomposed, zeros are black beasleyC1 raw, zeros are white beasleyC1 decomposed, zeros are white
58 beasleyC2 [MIPLIB] F. Ortega, L. Wolsey Fixed cost network flow problems beasley beasleyC2 raw, zeros are black beasleyC2 decomposed, zeros are black beasleyC2 raw, zeros are white beasleyC2 decomposed, zeros are white
59 beasleyC3 [MIPLIB] F. Ortega, L. Wolsey Fixed cost network flow problems beasley beasleyC3 raw, zeros are black beasleyC3 decomposed, zeros are black beasleyC3 raw, zeros are white beasleyC3 decomposed, zeros are white
60 beavma [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - beavma raw, zeros are black beavma decomposed, zeros are black beavma raw, zeros are white beavma decomposed, zeros are white
61 berlin [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - berlin raw, zeros are black berlin decomposed, zeros are black berlin raw, zeros are white berlin decomposed, zeros are white
62 berlin_5_8_0 [MIPLIB] G. Klau Railway optimization problems. The problem was solved using CPLEX 12.3 on a 32 core Sun Galaxy 4600 machine, equipped with eight Quad-Core AMD Opteron 8384 processors at 2.7 GHz and 512 GB RAM. It took approximately 9 hours. The problem was solved using CPLEX 12.4 in about 55 minutes (May 2014). - berlin_5_8_0 raw, zeros are black berlin_5_8_0 decomposed, zeros are black berlin_5_8_0 raw, zeros are white berlin_5_8_0 decomposed, zeros are white
63 bg512142 [MIPLIB] A. Miller Multilevel lot-sizing instance. - bg512142 raw, zeros are black bg512142 decomposed, zeros are black bg512142 raw, zeros are white bg512142 decomposed, zeros are white
64 bharat [MIPLIB] Gavin Goodall MILP for optimizing fuel use at a forward operating base - bharat raw, zeros are black bharat decomposed, zeros are black bharat raw, zeros are white bharat decomposed, zeros are white
65 biella1 [MIPLIB] Double-Click SAS Crew scheduling instance - biella1 raw, zeros are black biella1 decomposed, zeros are black biella1 raw, zeros are white biella1 decomposed, zeros are white
66 bienst1 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - bienst1 raw, zeros are black bienst1 decomposed, zeros are black bienst1 raw, zeros are white bienst1 decomposed, zeros are white
67 bienst2 [MIPLIB] H. Mittelmann Relaxed version of problem bienst - bienst2 raw, zeros are black bienst2 decomposed, zeros are black bienst2 raw, zeros are white bienst2 decomposed, zeros are white
68 binkar10_1 [MIPLIB] H. Mittelmann Relaxed version of problem binkar10 - binkar10_1 raw, zeros are black binkar10_1 decomposed, zeros are black binkar10_1 raw, zeros are white binkar10_1 decomposed, zeros are white
69 blend2 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - blend2 raw, zeros are black blend2 decomposed, zeros are black blend2 raw, zeros are white blend2 decomposed, zeros are white
70 blp-ar98 [MIPLIB] M. Lübbecke Railway line planning instance blp blp-ar98 raw, zeros are black blp-ar98 decomposed, zeros are black blp-ar98 raw, zeros are white blp-ar98 decomposed, zeros are white
71 blp-ic97 [MIPLIB] M. Lübbecke Railway line planning instance. Solved using CPLEX 12.3 (12 threads) on an Intel Xeon X5650 @ 2.67GHz, 12MB cache, 24GB RAM in 4947.5 sec.\xa0Solved using Gurobi 4.6.1 (12 threads) in 1867.9 sec. blp blp-ic97 raw, zeros are black blp-ic97 decomposed, zeros are black blp-ic97 raw, zeros are white blp-ic97 decomposed, zeros are white
72 blp-ic98 [MIPLIB] M. Lübbecke Railway line planning instance blp blp-ic98 raw, zeros are black blp-ic98 decomposed, zeros are black blp-ic98 raw, zeros are white blp-ic98 decomposed, zeros are white
73 blp-ir98 [MIPLIB] M. Lübbecke Railway line planning instance blp blp-ir98 raw, zeros are black blp-ir98 decomposed, zeros are black blp-ir98 raw, zeros are white blp-ir98 decomposed, zeros are white
74 bmocbd [MIPLIB] Sean MacDermant BMO CBD bmocbd bmocbd raw, zeros are black bmocbd decomposed, zeros are black bmocbd raw, zeros are white bmocbd decomposed, zeros are white
75 bmocbd2 [MIPLIB] Sean MacDermant BMOCBD2 bmocbd bmocbd2 raw, zeros are black bmocbd2 decomposed, zeros are black bmocbd2 raw, zeros are white bmocbd2 decomposed, zeros are white
76 bmoipr2 [MIPLIB] Sean MacDermant BMO IPR2 Logistics - bmoipr2 raw, zeros are black bmoipr2 decomposed, zeros are black bmoipr2 raw, zeros are white bmoipr2 decomposed, zeros are white
77 bnatt400 [MIPLIB] Tatsuya Akutsu Model to identify a singleton attractor in a Boolean network, applications in computational systems biology. Solved by SCIP 3.0 with SoPlex 1.7.0 in half an hour. A Intel Core2 Extreme CPU X9659 @3.00GHz was used. bnatt bnatt400 raw, zeros are black bnatt400 decomposed, zeros are black bnatt400 raw, zeros are white bnatt400 decomposed, zeros are white
78 bnatt500 [MIPLIB] Tatsuya Akutsu We are submitting ILP data for identification of a singletonattractor in a Boolean newtork, which is a well-known problemin computational systems biology.This problem is known to be NP-hard and we developed a methodto transform an instance of the problem to an integer linearprogram (ILP).We used ILPs from artificially generated Boolean networks ofindegree 3.The size of the networks are: 350, 400, 500.Even for the case of 500, we could not find a solution within6 hours using CPLEX 11.2 on a PC with XEON 5470 3.33GHz CPU.(This ILP corresponds to the case of size=350.File format is (zipped) CPLEX LP format.)The details of the method appeared in:T. Akutsu, M. Hayashida and T. Tamura, Integer programming-basedmethods for attractor detection and control of Boolean networks,Proc. The combined 48th IEEE Conference on Decision and Controland 28th Chinese Control Conference (IEEE CDC/CCC 2009), 5610-5617, 2009. bnatt bnatt500 raw, zeros are black bnatt500 decomposed, zeros are black bnatt500 raw, zeros are white bnatt500 decomposed, zeros are white
79 bppc4-08 [MIPLIB] Manuel Iori The models that we attach solve the "bar-relaxation", also known as the "Bin Packing Problem with Contiguity" or the "P||Cmax with contiguity". This is one of the most interesting relaxations for two dimensional cutting and packing problems. Its solution by means of an ILP software is the bottleneck of the primal decomposition methods that we attempted in the paper cited below. In detail, the files correspond to model (12)-(15) in the paper, applied to the instances of the Classes 4, 6 and 8 by Martello and Vigo (Management Science, 1998). bppc bppc4-08 raw, zeros are black bppc4-08 decomposed, zeros are black bppc4-08 raw, zeros are white bppc4-08 decomposed, zeros are white
80 bppc6-02 [MIPLIB] Manuel Iori The models that we attach solve the "bar-relaxation", also known as the "Bin Packing Problem with Contiguity" or the "P||Cmax with contiguity". This is one of the most interesting relaxations for two dimensional cutting and packing problems. Its solution by means of an ILP software is the bottleneck of the primal decomposition methods that we attempted in the paper cited below. In detail, the files correspond to model (12)-(15) in the paper, applied to the instances of the Classes 4, 6 and 8 by Martello and Vigo (Management Science, 1998). bppc bppc6-02 raw, zeros are black bppc6-02 decomposed, zeros are black bppc6-02 raw, zeros are white bppc6-02 decomposed, zeros are white
81 bppc6-06 [MIPLIB] Manuel Iori The models that we attach solve the "bar-relaxation", also known as the "Bin Packing Problem with Contiguity" or the "P||Cmax with contiguity". This is one of the most interesting relaxations for two dimensional cutting and packing problems. Its solution by means of an ILP software is the bottleneck of the primal decomposition methods that we attempted in the paper cited below. In detail, the files correspond to model (12)-(15) in the paper, applied to the instances of the Classes 4, 6 and 8 by Martello and Vigo (Management Science, 1998). bppc bppc6-06 raw, zeros are black bppc6-06 decomposed, zeros are black bppc6-06 raw, zeros are white bppc6-06 decomposed, zeros are white
82 bppc8-02 [MIPLIB] Manuel Iori The models that we attach solve the "bar-relaxation", also known as the "Bin Packing Problem with Contiguity" or the "P||Cmax with contiguity". This is one of the most interesting relaxations for two dimensional cutting and packing problems. Its solution by means of an ILP software is the bottleneck of the primal decomposition methods that we attempted in the paper cited below. In detail, the files correspond to model (12)-(15) in the paper, applied to the instances of the Classes 4, 6 and 8 by Martello and Vigo (Management Science, 1998). bppc bppc8-02 raw, zeros are black bppc8-02 decomposed, zeros are black bppc8-02 raw, zeros are white bppc8-02 decomposed, zeros are white
83 bppc8-09 [MIPLIB] Manuel Iori The models that we attach solve the "bar-relaxation", also known as the "Bin Packing Problem with Contiguity" or the "P||Cmax with contiguity". This is one of the most interesting relaxations for two dimensional cutting and packing problems. Its solution by means of an ILP software is the bottleneck of the primal decomposition methods that we attempted in the paper cited below. In detail, the files correspond to model (12)-(15) in the paper, applied to the instances of the Classes 4, 6 and 8 by Martello and Vigo (Management Science, 1998). bppc bppc8-09 raw, zeros are black bppc8-09 decomposed, zeros are black bppc8-09 raw, zeros are white bppc8-09 decomposed, zeros are white
84 brasil [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - brasil raw, zeros are black brasil decomposed, zeros are black brasil raw, zeros are white brasil decomposed, zeros are white
85 brazil3 [MIPLIB] George Fonseca Educational timetabling problems from several real schools/universities around the world. These instances were originally expressed in the xhstt file format [1] and formulated as Integer Programming models as described at [2]. timetabling brazil3 raw, zeros are black brazil3 decomposed, zeros are black brazil3 raw, zeros are white brazil3 decomposed, zeros are white
86 breastcancer-regularized [MIPLIB] Berk Ustun MIP to create optimized data-driven scoring systems. See: https://github.com/ustunb/miplib2017-slim#miplib2017-slim for a description. ustun breastcancer-regularized raw, zeros are black breastcancer-regularized decomposed, zeros are black breastcancer-regularized raw, zeros are white breastcancer-regularized decomposed, zeros are white
87 bts4-cta [MIPLIB] Jordi Castro Set of MILP instances of the CTA (Controlled Tabular Adjustment) problem, a method to protect statistical tabular data, belonging to the field of SDC (Statistical Disclosure Control). Raw data of instances are real or pseudo-real, provided by several National Statistical Agencies. We generated the CTA problem for these data. cta bts4-cta raw, zeros are black bts4-cta decomposed, zeros are black bts4-cta raw, zeros are white bts4-cta decomposed, zeros are white
88 buildingenergy [MIPLIB] Kristopher A. Pruitt Model to determine the minimum cost design and dispatch of a distributed generation system for a commercial building. First solved by Matteo Fischetti and Michele Monaci using a search procedure built on top of Cplex 12.2 (February 2012). Solved by Gurobi 4.6.1 (12 threads) in 1053 seconds (February 2012). - buildingenergy raw, zeros are black buildingenergy decomposed, zeros are black buildingenergy raw, zeros are white buildingenergy decomposed, zeros are white
89 cap6000 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - cap6000 raw, zeros are black cap6000 decomposed, zeros are black cap6000 raw, zeros are white cap6000 decomposed, zeros are white
90 cbs-cta [MIPLIB] Jordi Castro Set of MILP instances of the CTA (Controlled Tabular Adjustment) problem, a method to protect statistical tabular data, belonging to the field of SDC (Statistical Disclosure Control). Raw data of instances are real or pseudo-real, provided by several National Statistical Agencies. We generated the CTA problem for these data. cta cbs-cta raw, zeros are black cbs-cta decomposed, zeros are black cbs-cta raw, zeros are white cbs-cta decomposed, zeros are white
91 cdc7-4-3-2 [MIPLIB] Sascha Kurz Codes for Networkcoding A constant dimension code with parameters n, k, d and q is a collection of k-dimensional subspaces of the n-dimensional vector space \\(GF(q)^n\\) over a finite field with q elements, called codewords, such that the dimension of the intersection of each pair of different k-dimensional subspaces is at most \\(k-d/2\\). Let \\(A_q(n,d;k)\\) denote the maximum number of codewords. For instance cdc6-4-3-2 \\(A_2(6,4;3)=77\\) is known , while \\(333 \\le A_2(7,4;3) \\le 381\\) for instance cdc7-4-3-2 are the tightest known bounds, see e.g. . A code of size 381 would correspond to a putative binary q-analog of the Fano plane (finite projective plane of order 2 with 7 points and lines). More bounds are available at http://subspacecodes.uni-bayreuth.de. - cdc7-4-3-2 raw, zeros are black cdc7-4-3-2 decomposed, zeros are black cdc7-4-3-2 raw, zeros are white cdc7-4-3-2 decomposed, zeros are white
92 cdma [MIPLIB] Serge Bisaillon 3G wireless multiplexing communication model - cdma raw, zeros are black cdma decomposed, zeros are black cdma raw, zeros are white cdma decomposed, zeros are white
93 chromaticindex1024-7 [MIPLIB] Pierre Le Bodic Simple edge-coloring model on chains of Petersen-like subgraphs, designed to fool MIP solvers into producing very large Branch-and-Bound trees. chromaticindex chromaticindex1024-7 raw, zeros are black chromaticindex1024-7 decomposed, zeros are black chromaticindex1024-7 raw, zeros are white chromaticindex1024-7 decomposed, zeros are white
94 chromaticindex128-5 [MIPLIB] Pierre Le Bodic Simple edge-coloring model on chains of Petersen-like subgraphs, designed to fool MIP solvers into producing very large Branch-and-Bound trees. chromaticindex chromaticindex128-5 raw, zeros are black chromaticindex128-5 decomposed, zeros are black chromaticindex128-5 raw, zeros are white chromaticindex128-5 decomposed, zeros are white
95 chromaticindex256-8 [MIPLIB] Pierre Le Bodic Simple edge-coloring model on chains of Petersen-like subgraphs, designed to fool MIP solvers into producing very large Branch-and-Bound trees. chromaticindex chromaticindex256-8 raw, zeros are black chromaticindex256-8 decomposed, zeros are black chromaticindex256-8 raw, zeros are white chromaticindex256-8 decomposed, zeros are white
96 chromaticindex32-8 [MIPLIB] Pierre Le Bodic Simple edge-coloring model on chains of Petersen-like subgraphs, designed to fool MIP solvers into producing very large Branch-and-Bound trees. chromaticindex chromaticindex32-8 raw, zeros are black chromaticindex32-8 decomposed, zeros are black chromaticindex32-8 raw, zeros are white chromaticindex32-8 decomposed, zeros are white
97 chromaticindex512-7 [MIPLIB] Pierre Le Bodic Simple edge-coloring model on chains of Petersen-like subgraphs, designed to fool MIP solvers into producing very large Branch-and-Bound trees. chromaticindex chromaticindex512-7 raw, zeros are black chromaticindex512-7 decomposed, zeros are black chromaticindex512-7 raw, zeros are white chromaticindex512-7 decomposed, zeros are white
98 ci-s4 [MIPLIB] Alexandra M. Newman minimizing violence in a counterinsurgency model (lot os regressions built in) - ci-s4 raw, zeros are black ci-s4 decomposed, zeros are black ci-s4 raw, zeros are white ci-s4 decomposed, zeros are white
99 circ10-3 [MIPLIB] M. Winkler Instance from the 2010 SAT conference pseudo-Boolean competition - circ10-3 raw, zeros are black circ10-3 decomposed, zeros are black circ10-3 raw, zeros are white circ10-3 decomposed, zeros are white
100 cmflsp40-24-10-7 [MIPLIB] Andrea Arias Capacitated Multi-Family Lot-Sizing Problem cmflsp cmflsp40-24-10-7 raw, zeros are black cmflsp40-24-10-7 decomposed, zeros are black cmflsp40-24-10-7 raw, zeros are white cmflsp40-24-10-7 decomposed, zeros are white
101 cmflsp40-36-2-10 [MIPLIB] Andrea Arias Capacitated Multi-Family Lot-Sizing Problem cmflsp cmflsp40-36-2-10 raw, zeros are black cmflsp40-36-2-10 decomposed, zeros are black cmflsp40-36-2-10 raw, zeros are white cmflsp40-36-2-10 decomposed, zeros are white
102 cmflsp50-24-10-4 [MIPLIB] Andrea Arias Capacitated Multi-Family Lot-Sizing Problem cmflsp cmflsp50-24-10-4 raw, zeros are black cmflsp50-24-10-4 decomposed, zeros are black cmflsp50-24-10-4 raw, zeros are white cmflsp50-24-10-4 decomposed, zeros are white
103 cmflsp50-24-8-8 [MIPLIB] Andrea Arias Capacitated Multi-Family Lot-Sizing Problem cmflsp cmflsp50-24-8-8 raw, zeros are black cmflsp50-24-8-8 decomposed, zeros are black cmflsp50-24-8-8 raw, zeros are white cmflsp50-24-8-8 decomposed, zeros are white
104 cmflsp60-36-2-6 [MIPLIB] Andrea Arias Capacitated Multi-Family Lot-Sizing Problem cmflsp cmflsp60-36-2-6 raw, zeros are black cmflsp60-36-2-6 decomposed, zeros are black cmflsp60-36-2-6 raw, zeros are white cmflsp60-36-2-6 decomposed, zeros are white
105 CMS750_4 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - CMS750_4 raw, zeros are black CMS750_4 decomposed, zeros are black CMS750_4 raw, zeros are white CMS750_4 decomposed, zeros are white
106 co-100 [MIPLIB] Axel Werner Model from optical access network planning - co-100 raw, zeros are black co-100 decomposed, zeros are black co-100 raw, zeros are white co-100 decomposed, zeros are white
107 cod105 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - cod105 raw, zeros are black cod105 decomposed, zeros are black cod105 raw, zeros are white cod105 decomposed, zeros are white
108 comp07-2idx [MIPLIB] Matias Sørensen Instances comp01-21 of curriculum based course timetabling from the International Timetabling Competition 2007. These are time-assignment models (Stage I of the decomposed model), which are smaller than the full model, but still hard to solve. coursetimetabling comp07-2idx raw, zeros are black comp07-2idx decomposed, zeros are black comp07-2idx raw, zeros are white comp07-2idx decomposed, zeros are white
109 comp08-2idx [MIPLIB] Matias Sørensen Instances comp01-21 of curriculum based course timetabling from the International Timetabling Competition 2007. These are time-assignment models (Stage I of the decomposed model), which are smaller than the full model, but still hard to solve. coursetimetabling comp08-2idx raw, zeros are black comp08-2idx decomposed, zeros are black comp08-2idx raw, zeros are white comp08-2idx decomposed, zeros are white
110 comp12-2idx [MIPLIB] Matias Sørensen Instances comp01-21 of curriculum based course timetabling from the International Timetabling Competition 2007. These are time-assignment models (Stage I of the decomposed model), which are smaller than the full model, but still hard to solve. coursetimetabling comp12-2idx raw, zeros are black comp12-2idx decomposed, zeros are black comp12-2idx raw, zeros are white comp12-2idx decomposed, zeros are white
111 comp16-3idx [MIPLIB] Matias Sørensen Instances comp01-21 of curriculum based course timetabling from the International Timetabling Competition 2007. These are the full models using three-index decision variables. coursetimetabling comp16-3idx raw, zeros are black comp16-3idx decomposed, zeros are black comp16-3idx raw, zeros are white comp16-3idx decomposed, zeros are white
112 comp21-2idx [MIPLIB] Matias Sørensen Instances comp01-21 of curriculum based course timetabling from the International Timetabling Competition 2007. These are time-assignment models (Stage I of the decomposed model), which are smaller than the full model, but still hard to solve. coursetimetabling comp21-2idx raw, zeros are black comp21-2idx decomposed, zeros are black comp21-2idx raw, zeros are white comp21-2idx decomposed, zeros are white
113 control20-5-10-5 [MIPLIB] Qie He Optimal control of a discrete-time switched system model Numerically challenging. Different solvers report this instance as solved to optimality, infeasible, or unbounded. control control20-5-10-5 raw, zeros are black control20-5-10-5 decomposed, zeros are black control20-5-10-5 raw, zeros are white control20-5-10-5 decomposed, zeros are white
114 control30-3-2-3 [MIPLIB] Qie He Optimal control of a discrete-time switched system model control control30-3-2-3 raw, zeros are black control30-3-2-3 decomposed, zeros are black control30-3-2-3 raw, zeros are white control30-3-2-3 decomposed, zeros are white
115 control30-5-10-4 [MIPLIB] Qie He Optimal control of a discrete-time switched system model control control30-5-10-4 raw, zeros are black control30-5-10-4 decomposed, zeros are black control30-5-10-4 raw, zeros are white control30-5-10-4 decomposed, zeros are white
116 core2536-691 [MIPLIB] A. Caprara, M. Fischetti, P. Toth Set covering instance coming from Italian railway models core core2536-691 raw, zeros are black core2536-691 decomposed, zeros are black core2536-691 raw, zeros are white core2536-691 decomposed, zeros are white
117 core2586-950 [MIPLIB] A. Caprara, M. Fischetti, P. Toth Set covering instance coming from Italian railway models core core2586-950 raw, zeros are black core2586-950 decomposed, zeros are black core2586-950 raw, zeros are white core2586-950 decomposed, zeros are white
118 core4284-1064 [MIPLIB] A. Caprara, M. Fischetti, P. Toth Set covering instance coming from Italian railway models core core4284-1064 raw, zeros are black core4284-1064 decomposed, zeros are black core4284-1064 raw, zeros are white core4284-1064 decomposed, zeros are white
119 core4872-1529 [MIPLIB] A. Caprara, M. Fischetti, P. Toth Set covering instance coming from Italian railway models core core4872-1529 raw, zeros are black core4872-1529 decomposed, zeros are black core4872-1529 raw, zeros are white core4872-1529 decomposed, zeros are white
120 cost266-UUE [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. network_design cost266-UUE raw, zeros are black cost266-UUE decomposed, zeros are black cost266-UUE raw, zeros are white cost266-UUE decomposed, zeros are white
121 cryptanalysiskb128n5obj14 [MIPLIB] Gleb Belov Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 cryptanalysis cryptanalysiskb128n5obj14 raw, zeros are black cryptanalysiskb128n5obj14 decomposed, zeros are black cryptanalysiskb128n5obj14 raw, zeros are white cryptanalysiskb128n5obj14 decomposed, zeros are white
122 cryptanalysiskb128n5obj16 [MIPLIB] Gleb Belov Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 cryptanalysis cryptanalysiskb128n5obj16 raw, zeros are black cryptanalysiskb128n5obj16 decomposed, zeros are black cryptanalysiskb128n5obj16 raw, zeros are white cryptanalysiskb128n5obj16 decomposed, zeros are white
123 csched007 [MIPLIB] Tallys Yunes Cumulative scheduling problem instance csched csched007 raw, zeros are black csched007 decomposed, zeros are black csched007 raw, zeros are white csched007 decomposed, zeros are white
124 csched008 [MIPLIB] Tallys Yunes Cumulative scheduling problem instance csched csched008 raw, zeros are black csched008 decomposed, zeros are black csched008 raw, zeros are white csched008 decomposed, zeros are white
125 csched010 [MIPLIB] Tallys Yunes Cumulative scheduling problem instance csched csched010 raw, zeros are black csched010 decomposed, zeros are black csched010 raw, zeros are white csched010 decomposed, zeros are white
126 cvrpa-n64k9vrpi [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 vrp cvrpa-n64k9vrpi raw, zeros are black cvrpa-n64k9vrpi decomposed, zeros are black cvrpa-n64k9vrpi raw, zeros are white cvrpa-n64k9vrpi decomposed, zeros are white
127 cvrpb-n45k5vrpi [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 pb- cvrpb-n45k5vrpi raw, zeros are black cvrpb-n45k5vrpi decomposed, zeros are black cvrpb-n45k5vrpi raw, zeros are white cvrpb-n45k5vrpi decomposed, zeros are white
128 cvrpp-n16k8vrpi [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 vrp cvrpp-n16k8vrpi raw, zeros are black cvrpp-n16k8vrpi decomposed, zeros are black cvrpp-n16k8vrpi raw, zeros are white cvrpp-n16k8vrpi decomposed, zeros are white
129 cvrpsimple2i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 vrp cvrpsimple2i raw, zeros are black cvrpsimple2i decomposed, zeros are black cvrpsimple2i raw, zeros are white cvrpsimple2i decomposed, zeros are white
130 cvs08r139-94 [MIPLIB] Michael Bastubbe Capacitated vertex separator problem on randomly generated hypergraph with 139 vertices and 94 hyperedges in at most 8 components each including at most 21 vertices. cvs cvs08r139-94 raw, zeros are black cvs08r139-94 decomposed, zeros are black cvs08r139-94 raw, zeros are white cvs08r139-94 decomposed, zeros are white
131 cvs16r106-72 [MIPLIB] Michael Bastubbe Capacitated vertex separator problem on randomly generated hypergraph with 106 vertices and 72 hyperedges in at most 16 components each including at most 7 vertices. cvs cvs16r106-72 raw, zeros are black cvs16r106-72 decomposed, zeros are black cvs16r106-72 raw, zeros are white cvs16r106-72 decomposed, zeros are white
132 cvs16r128-89 [MIPLIB] Michael Bastubbe Capacitated vertex separator problem on randomly generated hypergraph with 128 vertices and 89 hyperedges in at most 16 components each including at most 8 vertices. solved with default GCG/Soplex in about 2000 seconds. cvs cvs16r128-89 raw, zeros are black cvs16r128-89 decomposed, zeros are black cvs16r128-89 raw, zeros are white cvs16r128-89 decomposed, zeros are white
133 cvs16r70-62 [MIPLIB] Michael Bastubbe Capacitated vertex separator problem on randomly generated hypergraph with 70 vertices and 62 hyperedges in at most 16 components each including at most 5 vertices. cvs cvs16r70-62 raw, zeros are black cvs16r70-62 decomposed, zeros are black cvs16r70-62 raw, zeros are white cvs16r70-62 decomposed, zeros are white
134 cvs16r89-60 [MIPLIB] Michael Bastubbe Capacitated vertex separator problem on randomly generated hypergraph with 89 vertices and 60 hyperedges in at most 16 components each including at most 6 vertices. cvs cvs16r89-60 raw, zeros are black cvs16r89-60 decomposed, zeros are black cvs16r89-60 raw, zeros are white cvs16r89-60 decomposed, zeros are white
135 d20200 [MIPLIB] COR@L test set Instance coming from the COR@L test set with unknown origin - d20200 raw, zeros are black d20200 decomposed, zeros are black d20200 raw, zeros are white d20200 decomposed, zeros are white
136 dale-cta [MIPLIB] Jordi Castro Set of MILP instances of the CTA (Controlled Tabular Adjustment) problem, a method to protect statistical tabular data, belonging to the field of SDC (Statistical Disclosure Control). Raw data of instances are real or pseudo-real, provided by several National Statistical Agencies. We generated the CTA problem for these data. cta dale-cta raw, zeros are black dale-cta decomposed, zeros are black dale-cta raw, zeros are white dale-cta decomposed, zeros are white
137 dano3_3 [MIPLIB] Daniel Bienstock Telecommunications applications dano dano3_3 raw, zeros are black dano3_3 decomposed, zeros are black dano3_3 raw, zeros are white dano3_3 decomposed, zeros are white
138 dano3_5 [MIPLIB] Daniel Bienstock Telecommunications applications dano dano3_5 raw, zeros are black dano3_5 decomposed, zeros are black dano3_5 raw, zeros are white dano3_5 decomposed, zeros are white
139 dano3mip [MIPLIB] Daniel Bienstock Telecommunications applications dano dano3mip raw, zeros are black dano3mip decomposed, zeros are black dano3mip raw, zeros are white dano3mip decomposed, zeros are white
140 danoint [MIPLIB] Daniel Bienstock Telecommunications applications dano danoint raw, zeros are black danoint decomposed, zeros are black danoint raw, zeros are white danoint decomposed, zeros are white
141 datt256 [MIPLIB] Jon Dattorro Model to find solution to the ``Eternity II'' puzzle - datt256 raw, zeros are black datt256 decomposed, zeros are black datt256 raw, zeros are white datt256 decomposed, zeros are white
142 dc1c [MIPLIB] Double-Click SAS Crew scheduling instance. This problem was solved on ISM supercomputer Fujitsu PRIMERGY RX200S5 (http://www.ism.ac.jp/computer_system/eng/sc/index.html) by ParaSCIP in approximately 1100 hours with 14 times restarted 15 jobs. - dc1c raw, zeros are black dc1c decomposed, zeros are black dc1c raw, zeros are white dc1c decomposed, zeros are white
143 dc1l [MIPLIB] Double-Click SAS Crew scheduling instance - dc1l raw, zeros are black dc1l decomposed, zeros are black dc1l raw, zeros are white dc1l decomposed, zeros are white
144 dcmulti [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - dcmulti raw, zeros are black dcmulti decomposed, zeros are black dcmulti raw, zeros are white dcmulti decomposed, zeros are white
145 decomp1 [MIPLIB] Martin Berger Finds special structures in MIPs. - decomp1 raw, zeros are black decomp1 decomposed, zeros are black decomp1 raw, zeros are white decomp1 decomposed, zeros are white
146 decomp2 [MIPLIB] Martin Berger Finds special structures in MIPs. - decomp2 raw, zeros are black decomp2 decomposed, zeros are black decomp2 raw, zeros are white decomp2 decomposed, zeros are white
147 dell [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - dell raw, zeros are black dell decomposed, zeros are black dell raw, zeros are white dell decomposed, zeros are white
148 dfn-bwin-DBE [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. network_design dfn-bwin-DBE raw, zeros are black dfn-bwin-DBE decomposed, zeros are black dfn-bwin-DBE raw, zeros are white dfn-bwin-DBE decomposed, zeros are white
149 dg012142 [MIPLIB] A. Miller Multilevel lot-sizing instance This instance was solved by using 256 cores of the distributed-memory supercomputer Fujitsu PRIMERGY RX200S5 (http://www.ism.ac.jp/computer_system/eng/sc/super.html). The problem was solved by ParaSCIP in approximately 43 hours. - dg012142 raw, zeros are black dg012142 decomposed, zeros are black dg012142 raw, zeros are white dg012142 decomposed, zeros are white
150 diameterc-mstc-v20a190d5i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 diameterc diameterc-mstc-v20a190d5i raw, zeros are black diameterc-mstc-v20a190d5i decomposed, zeros are black diameterc-mstc-v20a190d5i raw, zeros are white diameterc-mstc-v20a190d5i decomposed, zeros are white
151 diameterc-msts-v40a100d5i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 diameterc diameterc-msts-v40a100d5i raw, zeros are black diameterc-msts-v40a100d5i decomposed, zeros are black diameterc-msts-v40a100d5i raw, zeros are white diameterc-msts-v40a100d5i decomposed, zeros are white
152 disctom [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - disctom raw, zeros are black disctom decomposed, zeros are black disctom raw, zeros are white disctom decomposed, zeros are white
153 dolom1 [MIPLIB] Double-Click SAS Crew scheduling instance. Solved with ParaSCIP with SCIP 3.0.1 linked to CPLEX 12.5 as an LP solver on HLRN III with 12288 cores in two runs First run found a feasible solution whose objective function value is 6615265.0000. Giving the feasible solution, the second run solved the instance in 13684.7671 sec. - dolom1 raw, zeros are black dolom1 decomposed, zeros are black dolom1 raw, zeros are white dolom1 decomposed, zeros are white
154 drayage-100-23 [MIPLIB] F. Jordan Srour The .rar file contains three folders: 1) R_mps with all of the instances (165, organized into 5 groups R0_, R25_, R50_, R75_, and R100_*), 2) results_and_runtimes with datafiles on the runtime and results, and 3) doc with documentation on the instances in the form of a pdf. drayage drayage-100-23 raw, zeros are black drayage-100-23 decomposed, zeros are black drayage-100-23 raw, zeros are white drayage-100-23 decomposed, zeros are white
155 ds [MIPLIB] MIPLIB submission pool Imported from MIPLIB2003. - ds raw, zeros are black ds decomposed, zeros are black ds raw, zeros are white ds decomposed, zeros are white
156 ds-big [MIPLIB] Steffen Weider Bus driver duty scheduling problem - ds-big raw, zeros are black ds-big decomposed, zeros are black ds-big raw, zeros are white ds-big decomposed, zeros are white
157 dsbmip [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - dsbmip raw, zeros are black dsbmip decomposed, zeros are black dsbmip raw, zeros are white dsbmip decomposed, zeros are white
158 dws008-01 [MIPLIB] Philipp Leise MILP for designing a decentralized water supply system for drinking water in skyscrapers. The nonlinear characteristics of pumps are integrated with the help of an aggregated convex combination. The instances vary in the total number of floors and load scenarios for water demand. First stage variables represent the layout decisions, second stage variables represent the operational parameters, such as the continuous rotating speed of pumps or binary switching decisions. dws dws008-01 raw, zeros are black dws008-01 decomposed, zeros are black dws008-01 raw, zeros are white dws008-01 decomposed, zeros are white
159 dws008-03 [MIPLIB] Philipp Leise MILP for designing a decentralized water supply system for drinking water in skyscrapers. The nonlinear characteristics of pumps are integrated with the help of an aggregated convex combination. The instances vary in the total number of floors and load scenarios for water demand. First stage variables represent the layout decisions, second stage variables represent the operational parameters, such as the continuous rotating speed of pumps or binary switching decisions. dws dws008-03 raw, zeros are black dws008-03 decomposed, zeros are black dws008-03 raw, zeros are white dws008-03 decomposed, zeros are white
160 dws012-01 [MIPLIB] Philipp Leise MILP for designing a decentralized water supply system for drinking water in skyscrapers. The nonlinear characteristics of pumps are integrated with the help of an aggregated convex combination. The instances vary in the total number of floors and load scenarios for water demand. First stage variables represent the layout decisions, second stage variables represent the operational parameters, such as the continuous rotating speed of pumps or binary switching decisions. dws dws012-01 raw, zeros are black dws012-01 decomposed, zeros are black dws012-01 raw, zeros are white dws012-01 decomposed, zeros are white
161 dws012-02 [MIPLIB] Philipp Leise MILP for designing a decentralized water supply system for drinking water in skyscrapers. The nonlinear characteristics of pumps are integrated with the help of an aggregated convex combination. The instances vary in the total number of floors and load scenarios for water demand. First stage variables represent the layout decisions, second stage variables represent the operational parameters, such as the continuous rotating speed of pumps or binary switching decisions. dws dws012-02 raw, zeros are black dws012-02 decomposed, zeros are black dws012-02 raw, zeros are white dws012-02 decomposed, zeros are white
162 dws012-03 [MIPLIB] Philipp Leise MILP for designing a decentralized water supply system for drinking water in skyscrapers. The nonlinear characteristics of pumps are integrated with the help of an aggregated convex combination. The instances vary in the total number of floors and load scenarios for water demand. First stage variables represent the layout decisions, second stage variables represent the operational parameters, such as the continuous rotating speed of pumps or binary switching decisions. dws dws012-03 raw, zeros are black dws012-03 decomposed, zeros are black dws012-03 raw, zeros are white dws012-03 decomposed, zeros are white
163 eil33-2 [MIPLIB] J. Linderoth Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB eil eil33-2 raw, zeros are black eil33-2 decomposed, zeros are black eil33-2 raw, zeros are white eil33-2 decomposed, zeros are white
164 eilA101-2 [MIPLIB] J. Linderoth Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB eil eilA101-2 raw, zeros are black eilA101-2 decomposed, zeros are black eilA101-2 raw, zeros are white eilA101-2 decomposed, zeros are white
165 eilC76-2 [MIPLIB] J. Linderoth Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB Imported from the MIPLIB2010 submissions. eil eilC76-2 raw, zeros are black eilC76-2 decomposed, zeros are black eilC76-2 raw, zeros are white eilC76-2 decomposed, zeros are white
166 elitserienhandball11i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 elitserienhandball elitserienhandball11i raw, zeros are black elitserienhandball11i decomposed, zeros are black elitserienhandball11i raw, zeros are white elitserienhandball11i decomposed, zeros are white
167 elitserienhandball13i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 elitserienhandball elitserienhandball13i raw, zeros are black elitserienhandball13i decomposed, zeros are black elitserienhandball13i raw, zeros are white elitserienhandball13i decomposed, zeros are white
168 elitserienhandball14i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 elitserienhandball elitserienhandball14i raw, zeros are black elitserienhandball14i decomposed, zeros are black elitserienhandball14i raw, zeros are white elitserienhandball14i decomposed, zeros are white
169 elitserienhandball3i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 elitserienhandball elitserienhandball3i raw, zeros are black elitserienhandball3i decomposed, zeros are black elitserienhandball3i raw, zeros are white elitserienhandball3i decomposed, zeros are white
170 enlight_hard [MIPLIB] A. Zymolka Model to solve instance of a combinatorial game ``EnLight'' Imported from the MIPLIB2010 submissions. enlight enlight_hard raw, zeros are black enlight_hard decomposed, zeros are black enlight_hard raw, zeros are white enlight_hard decomposed, zeros are white
171 enlight11 [MIPLIB] A. Zymolka Model to solve instance of a combinatorial game ``EnLight'' Imported from the MIPLIB2010 submissions. enlight enlight11 raw, zeros are black enlight11 decomposed, zeros are black enlight11 raw, zeros are white enlight11 decomposed, zeros are white
172 enlight4 [MIPLIB] A. Zymolka Model to solve instance of a combinatorial game ``EnLight'' Imported from the MIPLIB2010 submissions. enlight enlight4 raw, zeros are black enlight4 decomposed, zeros are black enlight4 raw, zeros are white enlight4 decomposed, zeros are white
173 enlight8 [MIPLIB] A. Zymolka Model to solve instance of a combinatorial game ``EnLight'' Imported from the MIPLIB2010 submissions. enlight enlight8 raw, zeros are black enlight8 decomposed, zeros are black enlight8 raw, zeros are white enlight8 decomposed, zeros are white
174 enlight9 [MIPLIB] A. Zymolka Model to solve instance of a combinatorial game ``EnLight'' enlight enlight9 raw, zeros are black enlight9 decomposed, zeros are black enlight9 raw, zeros are white enlight9 decomposed, zeros are white
175 eva1aprime5x5opt [MIPLIB] Yoshihiro Kanno MILP approach to generate structures with negative thermal expansion coefficients evaprime eva1aprime5x5opt raw, zeros are black eva1aprime5x5opt decomposed, zeros are black eva1aprime5x5opt raw, zeros are white eva1aprime5x5opt decomposed, zeros are white
176 eva1aprime6x6opt [MIPLIB] Yoshihiro Kanno MILP approach to generate structures with negative thermal expansion coefficients evaprime eva1aprime6x6opt raw, zeros are black eva1aprime6x6opt decomposed, zeros are black eva1aprime6x6opt raw, zeros are white eva1aprime6x6opt decomposed, zeros are white
177 ex10 [MIPLIB] Iulian Ober Formulations of Boolean SAT instance - ex10 raw, zeros are black ex10 decomposed, zeros are black ex10 raw, zeros are white ex10 decomposed, zeros are white
178 ex1010-pi [MIPLIB] M. Winkler Logic synthesis problem from the 2010 SAT conference pseudo-Boolean competition - ex1010-pi raw, zeros are black ex1010-pi decomposed, zeros are black ex1010-pi raw, zeros are white ex1010-pi decomposed, zeros are white
179 ex9 [MIPLIB] Iulian Ober Formulations of Boolean SAT instance - ex9 raw, zeros are black ex9 decomposed, zeros are black ex9 raw, zeros are white ex9 decomposed, zeros are white
180 exp-1-500-5-5 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. exp_and_fc exp-1-500-5-5 raw, zeros are black exp-1-500-5-5 decomposed, zeros are black exp-1-500-5-5 raw, zeros are white exp-1-500-5-5 decomposed, zeros are white
181 f2000 [MIPLIB] M. Winkler Reformulated SAT instance from the 2010 SAT conference pseudo-Boolean competition - f2000 raw, zeros are black f2000 decomposed, zeros are black f2000 raw, zeros are white f2000 decomposed, zeros are white
182 f2gap201600 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) f2gap f2gap201600 raw, zeros are black f2gap201600 decomposed, zeros are black f2gap201600 raw, zeros are white f2gap201600 decomposed, zeros are white
183 f2gap401600 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) f2gap f2gap401600 raw, zeros are black f2gap401600 decomposed, zeros are black f2gap401600 raw, zeros are white f2gap401600 decomposed, zeros are white
184 f2gap40400 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) f2gap f2gap40400 raw, zeros are black f2gap40400 decomposed, zeros are black f2gap40400 raw, zeros are white f2gap40400 decomposed, zeros are white
185 f2gap801600 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) f2gap f2gap801600 raw, zeros are black f2gap801600 decomposed, zeros are black f2gap801600 raw, zeros are white f2gap801600 decomposed, zeros are white
186 fast0507 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - fast0507 raw, zeros are black fast0507 decomposed, zeros are black fast0507 raw, zeros are white fast0507 decomposed, zeros are white
187 fastxgemm-n2r6s0t2 [MIPLIB] Laurent Sorber Naive multiplication of two N by N matrices requires N^3 scalar multiplications. For N=2, Strassen showed that it could be done in only R=7 < 8=N^3 multiplications. For N=3, it is known that 19 <= R <= 23, and for N=4 it is known that 34 <= R <= 49. This repository contains code that generates a mixed-integer linear program (MILP) formulation of the fast matrix multiplication problem for finding solutions with R < N^3 and proving that they are optimal. For a more detailed description, see the accompanying manuscript. fastxgemm fastxgemm-n2r6s0t2 raw, zeros are black fastxgemm-n2r6s0t2 decomposed, zeros are black fastxgemm-n2r6s0t2 raw, zeros are white fastxgemm-n2r6s0t2 decomposed, zeros are white
188 fastxgemm-n2r7s4t1 [MIPLIB] Laurent Sorber Naive multiplication of two N by N matrices requires N^3 scalar multiplications. For N=2, Strassen showed that it could be done in only R=7 < 8=N^3 multiplications. For N=3, it is known that 19 <= R <= 23, and for N=4 it is known that 34 <= R <= 49. This repository contains code that generates a mixed-integer linear program (MILP) formulation of the fast matrix multiplication problem for finding solutions with R < N^3 and proving that they are optimal. For a more detailed description, see the accompanying manuscript. fastxgemm fastxgemm-n2r7s4t1 raw, zeros are black fastxgemm-n2r7s4t1 decomposed, zeros are black fastxgemm-n2r7s4t1 raw, zeros are white fastxgemm-n2r7s4t1 decomposed, zeros are white
189 fastxgemm-n3r21s3t6 [MIPLIB] Laurent Sorber Naive multiplication of two N by N matrices requires N^3 scalar multiplications. For N=2, Strassen showed that it could be done in only R=7 < 8=N^3 multiplications. For N=3, it is known that 19 <= R <= 23, and for N=4 it is known that 34 <= R <= 49. This repository contains code that generates a mixed-integer linear program (MILP) formulation of the fast matrix multiplication problem for finding solutions with R < N^3 and proving that they are optimal. For a more detailed description, see the accompanying manuscript. fastxgemm fastxgemm-n3r21s3t6 raw, zeros are black fastxgemm-n3r21s3t6 decomposed, zeros are black fastxgemm-n3r21s3t6 raw, zeros are white fastxgemm-n3r21s3t6 decomposed, zeros are white
190 fastxgemm-n3r22s4t6 [MIPLIB] Laurent Sorber Naive multiplication of two N by N matrices requires N^3 scalar multiplications. For N=2, Strassen showed that it could be done in only R=7 < 8=N^3 multiplications. For N=3, it is known that 19 <= R <= 23, and for N=4 it is known that 34 <= R <= 49. This repository contains code that generates a mixed-integer linear program (MILP) formulation of the fast matrix multiplication problem for finding solutions with R < N^3 and proving that they are optimal. For a more detailed description, see the accompanying manuscript. fastxgemm fastxgemm-n3r22s4t6 raw, zeros are black fastxgemm-n3r22s4t6 decomposed, zeros are black fastxgemm-n3r22s4t6 raw, zeros are white fastxgemm-n3r22s4t6 decomposed, zeros are white
191 fastxgemm-n3r23s5t6 [MIPLIB] Laurent Sorber Naive multiplication of two N by N matrices requires N^3 scalar multiplications. For N=2, Strassen showed that it could be done in only R=7 < 8=N^3 multiplications. For N=3, it is known that 19 <= R <= 23, and for N=4 it is known that 34 <= R <= 49. This repository contains code that generates a mixed-integer linear program (MILP) formulation of the fast matrix multiplication problem for finding solutions with R < N^3 and proving that they are optimal. For a more detailed description, see the accompanying manuscript. fastxgemm fastxgemm-n3r23s5t6 raw, zeros are black fastxgemm-n3r23s5t6 decomposed, zeros are black fastxgemm-n3r23s5t6 raw, zeros are white fastxgemm-n3r23s5t6 decomposed, zeros are white
192 fhnw-binpack4-18 [MIPLIB] Simon Felix Feasability-only 3D bin packing with additional constraints binpack fhnw-binpack4-18 raw, zeros are black fhnw-binpack4-18 decomposed, zeros are black fhnw-binpack4-18 raw, zeros are white fhnw-binpack4-18 decomposed, zeros are white
193 fhnw-binpack4-4 [MIPLIB] Simon Felix Feasability-only 3D bin packing with additional constraints binpack fhnw-binpack4-4 raw, zeros are black fhnw-binpack4-4 decomposed, zeros are black fhnw-binpack4-4 raw, zeros are white fhnw-binpack4-4 decomposed, zeros are white
194 fhnw-binpack4-48 [MIPLIB] Simon Felix Feasability-only 3D bin packing with additional constraints binpack fhnw-binpack4-48 raw, zeros are black fhnw-binpack4-48 decomposed, zeros are black fhnw-binpack4-48 raw, zeros are white fhnw-binpack4-48 decomposed, zeros are white
195 fhnw-binpack4-58 [MIPLIB] Simon Felix Feasability-only 3D bin packing with additional constraints binpack fhnw-binpack4-58 raw, zeros are black fhnw-binpack4-58 decomposed, zeros are black fhnw-binpack4-58 raw, zeros are white fhnw-binpack4-58 decomposed, zeros are white
196 fhnw-binpack4-77 [MIPLIB] Simon Felix Feasability-only 3D bin packing with additional constraints binpack fhnw-binpack4-77 raw, zeros are black fhnw-binpack4-77 decomposed, zeros are black fhnw-binpack4-77 raw, zeros are white fhnw-binpack4-77 decomposed, zeros are white
197 fhnw-binschedule0 [MIPLIB] Simon Felix Scheduling/assignment for an industrial production pipeline fhnw-bin fhnw-binschedule0 raw, zeros are black fhnw-binschedule0 decomposed, zeros are black fhnw-binschedule0 raw, zeros are white fhnw-binschedule0 decomposed, zeros are white
198 fhnw-binschedule1 [MIPLIB] Simon Felix Scheduling/assignment for an industrial production pipeline fhnw-bin fhnw-binschedule1 raw, zeros are black fhnw-binschedule1 decomposed, zeros are black fhnw-binschedule1 raw, zeros are white fhnw-binschedule1 decomposed, zeros are white
199 fhnw-binschedule2 [MIPLIB] Simon Felix Scheduling/assignment for an industrial production pipeline fhnw-bin fhnw-binschedule2 raw, zeros are black fhnw-binschedule2 decomposed, zeros are black fhnw-binschedule2 raw, zeros are white fhnw-binschedule2 decomposed, zeros are white
200 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. schedule fhnw-schedule-paira100 raw, zeros are black fhnw-schedule-paira100 decomposed, zeros are black fhnw-schedule-paira100 raw, zeros are white fhnw-schedule-paira100 decomposed, zeros are white
201 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. schedule fhnw-schedule-paira200 raw, zeros are black fhnw-schedule-paira200 decomposed, zeros are black fhnw-schedule-paira200 raw, zeros are white fhnw-schedule-paira200 decomposed, zeros are white
202 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. schedule fhnw-schedule-paira400 raw, zeros are black fhnw-schedule-paira400 decomposed, zeros are black fhnw-schedule-paira400 raw, zeros are white fhnw-schedule-paira400 decomposed, zeros are white
203 fhnw-schedule-pairb200 [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. schedule fhnw-schedule-pairb200 raw, zeros are black fhnw-schedule-pairb200 decomposed, zeros are black fhnw-schedule-pairb200 raw, zeros are white fhnw-schedule-pairb200 decomposed, zeros are white
204 fhnw-schedule-pairb400 [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. schedule fhnw-schedule-pairb400 raw, zeros are black fhnw-schedule-pairb400 decomposed, zeros are black fhnw-schedule-pairb400 raw, zeros are white fhnw-schedule-pairb400 decomposed, zeros are white
205 fhnw-sq2 [MIPLIB] Simon Felix Combinatorial toy fesability problem: Magic square. Instances 1 & 2 are feasible, instance 3 is unknown. Reported to be solved after 46883 seconds with ParaSCIP using 72 cores. fhnw-sq fhnw-sq2 raw, zeros are black fhnw-sq2 decomposed, zeros are black fhnw-sq2 raw, zeros are white fhnw-sq2 decomposed, zeros are white
206 fhnw-sq3 [MIPLIB] Simon Felix Combinatorial toy fesability problem: Magic square. Instances 1 & 2 are feasible, instance 3 is unknown. fhnw-sq fhnw-sq3 raw, zeros are black fhnw-sq3 decomposed, zeros are black fhnw-sq3 raw, zeros are white fhnw-sq3 decomposed, zeros are white
207 fiball [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - fiball raw, zeros are black fiball decomposed, zeros are black fiball raw, zeros are white fiball decomposed, zeros are white
208 fiber [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - fiber raw, zeros are black fiber decomposed, zeros are black fiber raw, zeros are white fiber decomposed, zeros are white
209 fillomino7x7-0i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 fillomino fillomino7x7-0i raw, zeros are black fillomino7x7-0i decomposed, zeros are black fillomino7x7-0i raw, zeros are white fillomino7x7-0i decomposed, zeros are white
210 fjspeasy01i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 fjsp fjspeasy01i raw, zeros are black fjspeasy01i decomposed, zeros are black fjspeasy01i raw, zeros are white fjspeasy01i decomposed, zeros are white
211 flugpl [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - flugpl raw, zeros are black flugpl decomposed, zeros are black flugpl raw, zeros are white flugpl decomposed, zeros are white
212 flugplinf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - flugplinf raw, zeros are black flugplinf decomposed, zeros are black flugplinf raw, zeros are white flugplinf decomposed, zeros are white
213 g200x740 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. fixed-cost-network-flow g200x740 raw, zeros are black g200x740 decomposed, zeros are black g200x740 raw, zeros are white g200x740 decomposed, zeros are white
214 g503inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - g503inf raw, zeros are black g503inf decomposed, zeros are black g503inf raw, zeros are white g503inf decomposed, zeros are white
215 gasprod1-1 [MIPLIB] Andrew Stamps Production planning model for an industrial gas process. Three instances of the model included. gasprod gasprod1-1 raw, zeros are black gasprod1-1 decomposed, zeros are black gasprod1-1 raw, zeros are white gasprod1-1 decomposed, zeros are white
216 gasprod1-2 [MIPLIB] Andrew Stamps Production planning model for an industrial gas process. Three instances of the model included. gasprod gasprod1-2 raw, zeros are black gasprod1-2 decomposed, zeros are black gasprod1-2 raw, zeros are white gasprod1-2 decomposed, zeros are white
217 gasprod1-3 [MIPLIB] Andrew Stamps Production planning model for an industrial gas process. Three instances of the model included. gasprod gasprod1-3 raw, zeros are black gasprod1-3 decomposed, zeros are black gasprod1-3 raw, zeros are white gasprod1-3 decomposed, zeros are white
218 gasprod2-1 [MIPLIB] Andrew Stamps Production planning model of a second industrial gas system. Two model instances included. gasprod gasprod2-1 raw, zeros are black gasprod2-1 decomposed, zeros are black gasprod2-1 raw, zeros are white gasprod2-1 decomposed, zeros are white
219 gasprod2-2 [MIPLIB] Andrew Stamps Production planning model of a second industrial gas system. Two model instances included. gasprod gasprod2-2 raw, zeros are black gasprod2-2 decomposed, zeros are black gasprod2-2 raw, zeros are white gasprod2-2 decomposed, zeros are white
220 gen [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - gen raw, zeros are black gen decomposed, zeros are black gen raw, zeros are white gen decomposed, zeros are white
221 gen-ip002 [MIPLIB] Simon Bowly Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms. generated gen-ip002 raw, zeros are black gen-ip002 decomposed, zeros are black gen-ip002 raw, zeros are white gen-ip002 decomposed, zeros are white
222 gen-ip016 [MIPLIB] Simon Bowly Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms. Solved with XPRESS in a few seconds. generated gen-ip016 raw, zeros are black gen-ip016 decomposed, zeros are black gen-ip016 raw, zeros are white gen-ip016 decomposed, zeros are white
223 gen-ip021 [MIPLIB] Simon Bowly Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms. generated gen-ip021 raw, zeros are black gen-ip021 decomposed, zeros are black gen-ip021 raw, zeros are white gen-ip021 decomposed, zeros are white
224 gen-ip036 [MIPLIB] Simon Bowly Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms. generated gen-ip036 raw, zeros are black gen-ip036 decomposed, zeros are black gen-ip036 raw, zeros are white gen-ip036 decomposed, zeros are white
225 gen-ip054 [MIPLIB] Simon Bowly Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms. generated gen-ip054 raw, zeros are black gen-ip054 decomposed, zeros are black gen-ip054 raw, zeros are white gen-ip054 decomposed, zeros are white
226 genus-g31-8 [MIPLIB] Stephan Beyer Minimum Genus instance of g.31.8 (undirected) of the AT&T Graphs by Stephen C. North. genus genus-g31-8 raw, zeros are black genus-g31-8 decomposed, zeros are black genus-g31-8 raw, zeros are white genus-g31-8 decomposed, zeros are white
227 genus-g61-25 [MIPLIB] Stephan Beyer Minimum Genus instance of g.61.25 (undirected) of the AT&T Graphs by Stephen C. North. genus genus-g61-25 raw, zeros are black genus-g61-25 decomposed, zeros are black genus-g61-25 raw, zeros are white genus-g61-25 decomposed, zeros are white
228 genus-sym-g31-8 [MIPLIB] Stephan Beyer Minimum Genus instance, with symmetry breaking constraints, of g.31.8 (undirected) of the AT&T Graphs by Stephen C. North. genus genus-sym-g31-8 raw, zeros are black genus-sym-g31-8 decomposed, zeros are black genus-sym-g31-8 raw, zeros are white genus-sym-g31-8 decomposed, zeros are white
229 genus-sym-g62-2 [MIPLIB] Stephan Beyer Minimum Genus instance, with symmetry breaking constraints, of g.62.2 (undirected) of the AT&T Graphs by Stephen C. North. genus genus-sym-g62-2 raw, zeros are black genus-sym-g62-2 decomposed, zeros are black genus-sym-g62-2 raw, zeros are white genus-sym-g62-2 decomposed, zeros are white
230 genus-sym-grafo5708-48 [MIPLIB] Stephan Beyer Minimum Genus instance of grafo5708.48 from the Rome Graphs, with symmetry-breaking constraints. genus genus-sym-grafo5708-48 raw, zeros are black genus-sym-grafo5708-48 decomposed, zeros are black genus-sym-grafo5708-48 raw, zeros are white genus-sym-grafo5708-48 decomposed, zeros are white
231 ger50_17_trans [MIPLIB] C. Raack Multi-layer network design problem using a link-flow formulation over a path-flow formulation. ger50 ger50_17_trans raw, zeros are black ger50_17_trans decomposed, zeros are black ger50_17_trans raw, zeros are white ger50_17_trans decomposed, zeros are white
232 ger50-17-ptp-pop-6t [MIPLIB] C. Raack Multi-layer network design problem using a link-flow formulation over a path-flow formulation. ger50 ger50-17-ptp-pop-6t raw, zeros are black ger50-17-ptp-pop-6t decomposed, zeros are black ger50-17-ptp-pop-6t raw, zeros are white ger50-17-ptp-pop-6t decomposed, zeros are white
233 ger50-17-trans-dfn-3t [MIPLIB] C. Raack Multi-layer network design problem using a link-flow formulation over a path-flow formulation. ger50 ger50-17-trans-dfn-3t raw, zeros are black ger50-17-trans-dfn-3t decomposed, zeros are black ger50-17-trans-dfn-3t raw, zeros are white ger50-17-trans-dfn-3t decomposed, zeros are white
234 germanrr [MIPLIB] Q. Chen Model from a German railroad company. Solved in June 2013 by CPLEX 12.5.1 (24 threads) in about 5.2 hours. - germanrr raw, zeros are black germanrr decomposed, zeros are black germanrr raw, zeros are white germanrr decomposed, zeros are white
235 germany50-UUM [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. network_design germany50-UUM raw, zeros are black germany50-UUM decomposed, zeros are black germany50-UUM raw, zeros are white germany50-UUM decomposed, zeros are white
236 gfd-schedulen180f7d50m30k18 [MIPLIB] Gleb Belov Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 gfd-schedule gfd-schedulen180f7d50m30k18 raw, zeros are black gfd-schedulen180f7d50m30k18 decomposed, zeros are black gfd-schedulen180f7d50m30k18 raw, zeros are white gfd-schedulen180f7d50m30k18 decomposed, zeros are white
237 gfd-schedulen25f5d20m10k3i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 gfd-schedule gfd-schedulen25f5d20m10k3i raw, zeros are black gfd-schedulen25f5d20m10k3i decomposed, zeros are black gfd-schedulen25f5d20m10k3i raw, zeros are white gfd-schedulen25f5d20m10k3i decomposed, zeros are white
238 gfd-schedulen55f2d50m30k3i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 gfd-schedule gfd-schedulen55f2d50m30k3i raw, zeros are black gfd-schedulen55f2d50m30k3i decomposed, zeros are black gfd-schedulen55f2d50m30k3i raw, zeros are white gfd-schedulen55f2d50m30k3i decomposed, zeros are white
239 ghoulomb4-9-10i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 ghoulomb ghoulomb4-9-10i raw, zeros are black ghoulomb4-9-10i decomposed, zeros are black ghoulomb4-9-10i raw, zeros are white ghoulomb4-9-10i decomposed, zeros are white
240 glass-sc [MIPLIB] Marc Pfetsch Set covering problems arising from a Benders algorithm for finding maximum feasible subsystems. More details on the generation is given in the README file in the tarball. maxfeassub glass-sc raw, zeros are black glass-sc decomposed, zeros are black glass-sc raw, zeros are white glass-sc decomposed, zeros are white
241 glass4 [MIPLIB] I. Luzzi Nesting instance - glass4 raw, zeros are black glass4 decomposed, zeros are black glass4 raw, zeros are white glass4 decomposed, zeros are white
242 gmu-35-40 [MIPLIB] Nora Konnyu Timber harvest scheduling model These are harvest scheduling models of hypothetical forest planning problems where net timber revenues are maximized over a planning horizon subject to four sets of constraints: 1. Each management unit can be harvested only once over the planning horizon, 2. Volume harvested in one planning period should not be less or more than some portion of that in the preceding period, 3. Area-weighted average age of the forest by the end of the plan should notbe less than a certain target age. 4. Clearcut size in any planning period has to be below a specific limit. Decision variable are management units and generalized management units (group of management units with a combined area not exceeding the limit on clearcut size) and can be either fully harvested or left untouched in any planning period, therefore there is a binary restriction on the decision variables. gmu gmu-35-40 raw, zeros are black gmu-35-40 decomposed, zeros are black gmu-35-40 raw, zeros are white gmu-35-40 decomposed, zeros are white
243 gmu-35-50 [MIPLIB] Nora Konnyu Timber harvest scheduling model These are harvest scheduling models of hypothetical forest planning problems where net timber revenues are maximized over a planning horizon subject to four sets of constraints: 1. Each management unit can be harvested only once over the planning horizon, 2. Volume harvested in one planning period should not be less or more than some portion of that in the preceding period, 3. Area-weighted average age of the forest by the end of the plan should notbe less than a certain target age. 4. Clearcut size in any planning period has to be below a specific limit. Decision variable are management units and generalized management units (group of management units with a combined area not exceeding the limit on clearcut size) and can be either fully harvested or left untouched in any planning period, therefore there is a binary restriction on the decision variables. gmu gmu-35-50 raw, zeros are black gmu-35-50 decomposed, zeros are black gmu-35-50 raw, zeros are white gmu-35-50 decomposed, zeros are white
244 gmut-75-50 [MIPLIB] Nora Konnyu Timber harvest scheduling model. Solved by ParaXpress in a 12288 core supercomputer run on HLRN III. These are harvest scheduling models of hypothetical forest planning problems where net timber revenues are maximized over a planning horizon subject to four sets of constraints: 1. Each management unit can be harvested only once over the planning horizon, 2. Volume harvested in one planning period should not be less or more than some portion of that in the preceding period, 3. Area-weighted average age of the forest by the end of the plan should notbe less than a certain target age. 4. Clearcut size in any planning period has to be below a specific limit. Decision variable are management units and generalized management units (group of management units with a combined area not exceeding the limit on clearcut size) and can be either fully harvested or left untouched in any planning period, therefore there is a binary restriction on the decision variables. gmu gmut-75-50 raw, zeros are black gmut-75-50 decomposed, zeros are black gmut-75-50 raw, zeros are white gmut-75-50 decomposed, zeros are white
245 gmut-76-40 [MIPLIB] Nora Konnyu Timber harvest scheduling model These are harvest scheduling models of hypothetical forest planning problems where net timber revenues are maximized over a planning horizon subject to four sets of constraints: 1. Each management unit can be harvested only once over the planning horizon, 2. Volume harvested in one planning period should not be less or more than some portion of that in the preceding period, 3. Area-weighted average age of the forest by the end of the plan should notbe less than a certain target age. 4. Clearcut size in any planning period has to be below a specific limit. Decision variable are management units and generalized management units (group of management units with a combined area not exceeding the limit on clearcut size) and can be either fully harvested or left untouched in any planning period, therefore there is a binary restriction on the decision variables. gmu gmut-76-40 raw, zeros are black gmut-76-40 decomposed, zeros are black gmut-76-40 raw, zeros are white gmut-76-40 decomposed, zeros are white
246 gmut-76-50 [MIPLIB] Nora Konnyu Timber harvest scheduling model These are harvest scheduling models of hypothetical forest planning problems where net timber revenues are maximized over a planning horizon subject to four sets of constraints: 1. Each management unit can be harvested only once over the planning horizon, 2. Volume harvested in one planning period should not be less or more than some portion of that in the preceding period, 3. Area-weighted average age of the forest by the end of the plan should notbe less than a certain target age. 4. Clearcut size in any planning period has to be below a specific limit. Decision variable are management units and generalized management units (group of management units with a combined area not exceeding the limit on clearcut size) and can be either fully harvested or left untouched in any planning period, therefore there is a binary restriction on the decision variables. gmu gmut-76-50 raw, zeros are black gmut-76-50 decomposed, zeros are black gmut-76-50 raw, zeros are white gmut-76-50 decomposed, zeros are white
247 gr4x6 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - gr4x6 raw, zeros are black gr4x6 decomposed, zeros are black gr4x6 raw, zeros are white gr4x6 decomposed, zeros are white
248 graph20-20-1rand [MIPLIB] Michael Bastubbe Packing Cuts in Undirected Graphs. Instances are described in 4.1. graphs graph20-20-1rand raw, zeros are black graph20-20-1rand decomposed, zeros are black graph20-20-1rand raw, zeros are white graph20-20-1rand decomposed, zeros are white
249 graph20-80-1rand [MIPLIB] Michael Bastubbe Packing Cuts in Undirected Graphs. Instances are described in 4.1. graphs graph20-80-1rand raw, zeros are black graph20-80-1rand decomposed, zeros are black graph20-80-1rand raw, zeros are white graph20-80-1rand decomposed, zeros are white
250 graph40-20-1rand [MIPLIB] Michael Bastubbe Packing Cuts in Undirected Graphs. Instances are described in 4.1. graphs graph40-20-1rand raw, zeros are black graph40-20-1rand decomposed, zeros are black graph40-20-1rand raw, zeros are white graph40-20-1rand decomposed, zeros are white
251 graph40-40-1rand [MIPLIB] Michael Bastubbe Packing Cuts in Undirected Graphs. Instances are described in 4.1. graphs graph40-40-1rand raw, zeros are black graph40-40-1rand decomposed, zeros are black graph40-40-1rand raw, zeros are white graph40-40-1rand decomposed, zeros are white
252 graph40-80-1rand [MIPLIB] Michael Bastubbe Packing Cuts in Undirected Graphs. Instances are described in 4.1. graphs graph40-80-1rand raw, zeros are black graph40-80-1rand decomposed, zeros are black graph40-80-1rand raw, zeros are white graph40-80-1rand decomposed, zeros are white
253 graphdraw-domain [MIPLIB] Cézar Augusto Nascimento e Silva In the Graph Drawing problem a set of symbols must be placed in a plane and their connections routed. The objective is to produce aesthetically pleasant, easy to read diagrams. As a primary concern one usually tries to minimize edges crossing, edges' length, waste of space and number of bents in the connections. When formulated with these constraints the problem becomes NP-Hard . In practice many additional complicating requirements can be included, such as non-uniform sizes for symbols. Thus, some heuristics such as the generalized force-direct method and Simulated Annealing have been proposed to tackle this problem. uses a grid structure to approach the Entity-Relationship (ER) drawing problem, emphasizing the differences between ER drawing and the more classical circuit drawing problems. presented different ways of producing graph layouts (e.g.: tree, orthogonal, visibility representations, hierarchic, among others) for general graphs with applications on different subjects. The ability to automatically produce high quality layouts is very important in many applications, one of these is Software Engineering: the availability of easy to understand ER diagrams, for instance, can improve the time needed for developers to master database models and increase their productivity. Our solution approach involves two phases: (\\(i\\)) firstly the optimal placement of entities is solved, i.e.: entities are positioned so as to minimize the distances between connected entities; and (\\(ii\\)) secondly, edges are routed minimizing bends and avoiding the inclusion of connectors too close. We present the model for the first phase of our problem. graphdraw graphdraw-domain raw, zeros are black graphdraw-domain decomposed, zeros are black graphdraw-domain raw, zeros are white graphdraw-domain decomposed, zeros are white
254 graphdraw-gemcutter [MIPLIB] Cézar Augusto Nascimento e Silva In the Graph Drawing problem a set of symbols must be placed in a plane and their connections routed. The objective is to produce aesthetically pleasant, easy to read diagrams. As a primary concern one usually tries to minimize edges crossing, edges' length, waste of space and number of bents in the connections. When formulated with these constraints the problem becomes NP-Hard . In practice many additional complicating requirements can be included, such as non-uniform sizes for symbols. Thus, some heuristics such as the generalized force-direct method and Simulated Annealing have been proposed to tackle this problem. uses a grid structure to approach the Entity-Relationship (ER) drawing problem, emphasizing the differences between ER drawing and the more classical circuit drawing problems. presented different ways of producing graph layouts (e.g.: tree, orthogonal, visibility representations, hierarchic, among others) for general graphs with applications on different subjects. The ability to automatically produce high quality layouts is very important in many applications, one of these is Software Engineering: the availability of easy to understand ER diagrams, for instance, can improve the time needed for developers to master database models and increase their productivity. Our solution approach involves two phases: (\\(i\\)) firstly the optimal placement of entities is solved, i.e.: entities are positioned so as to minimize the distances between connected entities; and (\\(ii\\)) secondly, edges are routed minimizing bends and avoiding the inclusion of connectors too close. We present the model for the first phase of our problem. graphdraw graphdraw-gemcutter raw, zeros are black graphdraw-gemcutter decomposed, zeros are black graphdraw-gemcutter raw, zeros are white graphdraw-gemcutter decomposed, zeros are white
255 graphdraw-grafo2 [MIPLIB] Cézar Augusto Nascimento e Silva In the Graph Drawing problem a set of symbols must be placed in a plane and their connections routed. The objective is to produce aesthetically pleasant, easy to read diagrams. As a primary concern one usually tries to minimize edges crossing, edges' length, waste of space and number of bents in the connections. When formulated with these constraints the problem becomes NP-Hard . In practice many additional complicating requirements can be included, such as non-uniform sizes for symbols. Thus, some heuristics such as the generalized force-direct method and Simulated Annealing have been proposed to tackle this problem. uses a grid structure to approach the Entity-Relationship (ER) drawing problem, emphasizing the differences between ER drawing and the more classical circuit drawing problems. presented different ways of producing graph layouts (e.g.: tree, orthogonal, visibility representations, hierarchic, among others) for general graphs with applications on different subjects. The ability to automatically produce high quality layouts is very important in many applications, one of these is Software Engineering: the availability of easy to understand ER diagrams, for instance, can improve the time needed for developers to master database models and increase their productivity. Our solution approach involves two phases: (\\(i\\)) firstly the optimal placement of entities is solved, i.e.: entities are positioned so as to minimize the distances between connected entities; and (\\(ii\\)) secondly, edges are routed minimizing bends and avoiding the inclusion of connectors too close. We present the model for the first phase of our problem. graphdraw graphdraw-grafo2 raw, zeros are black graphdraw-grafo2 decomposed, zeros are black graphdraw-grafo2 raw, zeros are white graphdraw-grafo2 decomposed, zeros are white
256 graphdraw-mainerd [MIPLIB] Cézar Augusto Nascimento e Silva In the Graph Drawing problem a set of symbols must be placed in a plane and their connections routed. The objective is to produce aesthetically pleasant, easy to read diagrams. As a primary concern one usually tries to minimize edges crossing, edges' length, waste of space and number of bents in the connections. When formulated with these constraints the problem becomes NP-Hard . In practice many additional complicating requirements can be included, such as non-uniform sizes for symbols. Thus, some heuristics such as the generalized force-direct method and Simulated Annealing have been proposed to tackle this problem. uses a grid structure to approach the Entity-Relationship (ER) drawing problem, emphasizing the differences between ER drawing and the more classical circuit drawing problems. presented different ways of producing graph layouts (e.g.: tree, orthogonal, visibility representations, hierarchic, among others) for general graphs with applications on different subjects. The ability to automatically produce high quality layouts is very important in many applications, one of these is Software Engineering: the availability of easy to understand ER diagrams, for instance, can improve the time needed for developers to master database models and increase their productivity. Our solution approach involves two phases: (\\(i\\)) firstly the optimal placement of entities is solved, i.e.: entities are positioned so as to minimize the distances between connected entities; and (\\(ii\\)) secondly, edges are routed minimizing bends and avoiding the inclusion of connectors too close. We present the model for the first phase of our problem. graphdraw graphdraw-mainerd raw, zeros are black graphdraw-mainerd decomposed, zeros are black graphdraw-mainerd raw, zeros are white graphdraw-mainerd decomposed, zeros are white
257 graphdraw-opmanager [MIPLIB] Cézar Augusto Nascimento e Silva In the Graph Drawing problem a set of symbols must be placed in a plane and their connections routed. The objective is to produce aesthetically pleasant, easy to read diagrams. As a primary concern one usually tries to minimize edges crossing, edges' length, waste of space and number of bents in the connections. When formulated with these constraints the problem becomes NP-Hard . In practice many additional complicating requirements can be included, such as non-uniform sizes for symbols. Thus, some heuristics such as the generalized force-direct method and Simulated Annealing have been proposed to tackle this problem. uses a grid structure to approach the Entity-Relationship (ER) drawing problem, emphasizing the differences between ER drawing and the more classical circuit drawing problems. presented different ways of producing graph layouts (e.g.: tree, orthogonal, visibility representations, hierarchic, among others) for general graphs with applications on different subjects. The ability to automatically produce high quality layouts is very important in many applications, one of these is Software Engineering: the availability of easy to understand ER diagrams, for instance, can improve the time needed for developers to master database models and increase their productivity. Our solution approach involves two phases: (\\(i\\)) firstly the optimal placement of entities is solved, i.e.: entities are positioned so as to minimize the distances between connected entities; and (\\(ii\\)) secondly, edges are routed minimizing bends and avoiding the inclusion of connectors too close. We present the model for the first phase of our problem. graphdraw graphdraw-opmanager raw, zeros are black graphdraw-opmanager decomposed, zeros are black graphdraw-opmanager raw, zeros are white graphdraw-opmanager decomposed, zeros are white
258 gsvm2rl12 [MIPLIB] Toni Sorrell Suport vector machine with ramp loss. GSVM2-RL is the formulation found in Hess E. and Brooks P. (2015) paper, The Support Vector Machine and Mixed Integer Linear Programming: Ramp Loss SVM with L1-Norm Regularization supportvectormachine gsvm2rl12 raw, zeros are black gsvm2rl12 decomposed, zeros are black gsvm2rl12 raw, zeros are white gsvm2rl12 decomposed, zeros are white
259 gsvm2rl3 [MIPLIB] Toni Sorrell Suport vector machine with ramp loss. GSVM2-RL is the formulation found in Hess E. and Brooks P. (2015) paper, The Support Vector Machine and Mixed Integer Linear Programming: Ramp Loss SVM with L1-Norm Regularization supportvectormachine gsvm2rl3 raw, zeros are black gsvm2rl3 decomposed, zeros are black gsvm2rl3 raw, zeros are white gsvm2rl3 decomposed, zeros are white
260 gsvm2rl5 [MIPLIB] Toni Sorrell Suport vector machine with ramp loss. GSVM2-RL is the formulation found in Hess E. and Brooks P. (2015) paper, The Support Vector Machine and Mixed Integer Linear Programming: Ramp Loss SVM with L1-Norm Regularization supportvectormachine gsvm2rl5 raw, zeros are black gsvm2rl5 decomposed, zeros are black gsvm2rl5 raw, zeros are white gsvm2rl5 decomposed, zeros are white
261 gsvm2rl9 [MIPLIB] Toni Sorrell Suport vector machine with ramp loss. GSVM2-RL is the formulation found in Hess E. and Brooks P. (2015) paper, The Support Vector Machine and Mixed Integer Linear Programming: Ramp Loss SVM with L1-Norm Regularization supportvectormachine gsvm2rl9 raw, zeros are black gsvm2rl9 decomposed, zeros are black gsvm2rl9 raw, zeros are white gsvm2rl9 decomposed, zeros are white
262 gt2 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - gt2 raw, zeros are black gt2 decomposed, zeros are black gt2 raw, zeros are white gt2 decomposed, zeros are white
263 gus-sch [MIPLIB] Alexandra M. Newman course scheduling model - gus-sch raw, zeros are black gus-sch decomposed, zeros are black gus-sch raw, zeros are white gus-sch decomposed, zeros are white
264 h50x2450 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. fixed-cost-network-flow h50x2450 raw, zeros are black h50x2450 decomposed, zeros are black h50x2450 raw, zeros are white h50x2450 decomposed, zeros are white
265 h80x6320 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. fixed-cost-network-flow h80x6320 raw, zeros are black h80x6320 decomposed, zeros are black h80x6320 raw, zeros are white h80x6320 decomposed, zeros are white
266 h80x6320d [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. fixed-cost-network-flow h80x6320d raw, zeros are black h80x6320d decomposed, zeros are black h80x6320d raw, zeros are white h80x6320d decomposed, zeros are white
267 hanoi5 [MIPLIB] M. Winkler Reformulated SAT instance from the 2010 SAT conference pseudo-Boolean competition. Solved due to the 2012 pseudo-Boolean competition. - hanoi5 raw, zeros are black hanoi5 decomposed, zeros are black hanoi5 raw, zeros are white hanoi5 decomposed, zeros are white
268 haprp [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - haprp raw, zeros are black haprp decomposed, zeros are black haprp raw, zeros are white haprp decomposed, zeros are white
269 hgms-det [MIPLIB] Jesus Rodriguez Maintenance scheduling of generators in hydropower systems hgms hgms-det raw, zeros are black hgms-det decomposed, zeros are black hgms-det raw, zeros are white hgms-det decomposed, zeros are white
270 hgms30 [MIPLIB] Jesus Rodriguez Maintenance scheduling of generators in hydropower systems hgms hgms30 raw, zeros are black hgms30 decomposed, zeros are black hgms30 raw, zeros are white hgms30 decomposed, zeros are white
271 hgms62 [MIPLIB] Jesus Rodriguez Maintenance scheduling of generators in hydropower systems hgms hgms62 raw, zeros are black hgms62 decomposed, zeros are black hgms62 raw, zeros are white hgms62 decomposed, zeros are white
272 highschool1-aigio [MIPLIB] George Fonseca Educational timetabling problems from several real schools/universities around the world. These instances were originally expressed in the xhstt file format [1] and formulated as Integer Programming models as described at [2]. timetabling highschool1-aigio raw, zeros are black highschool1-aigio decomposed, zeros are black highschool1-aigio raw, zeros are white highschool1-aigio decomposed, zeros are white
273 hypothyroid-k1 [MIPLIB] Gleb Belov Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 hypothyroid hypothyroid-k1 raw, zeros are black hypothyroid-k1 decomposed, zeros are black hypothyroid-k1 raw, zeros are white hypothyroid-k1 decomposed, zeros are white
274 ic97_potential [MIPLIB] L. Peeters A model for cyclic railway timetable optimization - ic97_potential raw, zeros are black ic97_potential decomposed, zeros are black ic97_potential raw, zeros are white ic97_potential decomposed, zeros are white
275 ic97_tension [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - ic97_tension raw, zeros are black ic97_tension decomposed, zeros are black ic97_tension raw, zeros are white ic97_tension decomposed, zeros are white
276 icir97_potential [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - icir97_potential raw, zeros are black icir97_potential decomposed, zeros are black icir97_potential raw, zeros are white icir97_potential decomposed, zeros are white
277 icir97_tension [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - icir97_tension raw, zeros are black icir97_tension decomposed, zeros are black icir97_tension raw, zeros are white icir97_tension decomposed, zeros are white
278 iis-glass-cov [MIPLIB] Marc Pfetsch 23 "middlehard" Set-Covering Instances for MIPLIB: they have a small number of variables compared to the number of constraints and CPLEX 12.1 needs about one hour to solve them.For more information, have a look into the readme file which explains how the instances can be created. iis iis-glass-cov raw, zeros are black iis-glass-cov decomposed, zeros are black iis-glass-cov raw, zeros are white iis-glass-cov decomposed, zeros are white
279 iis-hc-cov [MIPLIB] Marc Pfetsch 23 "middlehard" Set-Covering Instances for MIPLIB: they have a small number of variables compared to the number of constraints and CPLEX 12.1 needs about one hour to solve them.For more information, have a look into the readme file which explains how the instances can be created. iis iis-hc-cov raw, zeros are black iis-hc-cov decomposed, zeros are black iis-hc-cov raw, zeros are white iis-hc-cov decomposed, zeros are white
280 irish-electricity [MIPLIB] Paula Carroll Unit Commitment - Irish Test systems We submit a sample Unit Commitment test instance based on an Irish case study. We include a readme file, a solution file, and additional data so that users may generate further UC test instances. - irish-electricity raw, zeros are black irish-electricity decomposed, zeros are black irish-electricity raw, zeros are white irish-electricity decomposed, zeros are white
281 irp [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - irp raw, zeros are black irp decomposed, zeros are black irp raw, zeros are white irp decomposed, zeros are white
282 istanbul-no-cutoff [MIPLIB] Utz-Uwe Haus Exact MILP reformulation using binary decision diagrams to obtain scenario bundles of 2-stage stochastic expected shortest path and expected maximum flow problem with decision dependent scenario probabilities. Notes: * very few binary variables * for each fixing of the binaries a system of equations computing conditioned probabilities remains - istanbul-no-cutoff raw, zeros are black istanbul-no-cutoff decomposed, zeros are black istanbul-no-cutoff raw, zeros are white istanbul-no-cutoff decomposed, zeros are white
283 ivu06 [MIPLIB] S. Weider Set partitioning instance resulting from a column generation algorithm used for duty scheduling in public transportation. Solved in June 2014 using CPLEX 12.6 with 48 threads in about 25 days. ivu ivu06 raw, zeros are black ivu06 decomposed, zeros are black ivu06 raw, zeros are white ivu06 decomposed, zeros are white
284 ivu52 [MIPLIB] S. Weider Set partitioning instance resulting from a column generation algorithm used for duty scheduling in public transportation. Solved in June 2014 using CPLEX 12.6 with 48 threads in about 25 days. ivu ivu52 raw, zeros are black ivu52 decomposed, zeros are black ivu52 raw, zeros are white ivu52 decomposed, zeros are white
285 k16x240b [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. fixed-cost-network-flow k16x240b raw, zeros are black k16x240b decomposed, zeros are black k16x240b raw, zeros are white k16x240b decomposed, zeros are white
286 k1mushroom [MIPLIB] Gleb Belov Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 k1mushroom k1mushroom raw, zeros are black k1mushroom decomposed, zeros are black k1mushroom raw, zeros are white k1mushroom decomposed, zeros are white
287 k1mushroomi [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 k1mushroom k1mushroomi raw, zeros are black k1mushroomi decomposed, zeros are black k1mushroomi raw, zeros are white k1mushroomi decomposed, zeros are white
288 khb05250 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - khb05250 raw, zeros are black khb05250 decomposed, zeros are black khb05250 raw, zeros are white khb05250 decomposed, zeros are white
289 kosova1 [MIPLIB] George Fonseca Educational timetabling problems from several real schools/universities around the world. These instances were originally expressed in the xhstt file format [1] and formulated as Integer Programming models as described at [2]. timetabling kosova1 raw, zeros are black kosova1 decomposed, zeros are black kosova1 raw, zeros are white kosova1 decomposed, zeros are white
290 l2p12 [MIPLIB] Gleb Belov Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 l2p l2p12 raw, zeros are black l2p12 decomposed, zeros are black l2p12 raw, zeros are white l2p12 decomposed, zeros are white
291 l2p1i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 l2p l2p1i raw, zeros are black l2p1i decomposed, zeros are black l2p1i raw, zeros are white l2p1i decomposed, zeros are white
292 l2p2i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 l2p l2p2i raw, zeros are black l2p2i decomposed, zeros are black l2p2i raw, zeros are white l2p2i decomposed, zeros are white
293 lectsched-1 [MIPLIB] Harald Schilly University lecture scheduling instance lectsched lectsched-1 raw, zeros are black lectsched-1 decomposed, zeros are black lectsched-1 raw, zeros are white lectsched-1 decomposed, zeros are white
294 lectsched-2 [MIPLIB] Harald Schilly University lecture scheduling instance lectsched lectsched-2 raw, zeros are black lectsched-2 decomposed, zeros are black lectsched-2 raw, zeros are white lectsched-2 decomposed, zeros are white
295 lectsched-3 [MIPLIB] Harald Schilly University lecture scheduling instance lectsched lectsched-3 raw, zeros are black lectsched-3 decomposed, zeros are black lectsched-3 raw, zeros are white lectsched-3 decomposed, zeros are white
296 lectsched-4-obj [MIPLIB] Harald Schilly University lecture scheduling instance lectsched lectsched-4-obj raw, zeros are black lectsched-4-obj decomposed, zeros are black lectsched-4-obj raw, zeros are white lectsched-4-obj decomposed, zeros are white
297 lectsched-5-obj [MIPLIB] Harald Schilly scheduling lectures at university - smaller subset of data with objective to minimize certain overlappings lectsched lectsched-5-obj raw, zeros are black lectsched-5-obj decomposed, zeros are black lectsched-5-obj raw, zeros are white lectsched-5-obj decomposed, zeros are white
298 leo1 [MIPLIB] COR@L test set Instance coming from the COR@L test set with unknown origin - leo1 raw, zeros are black leo1 decomposed, zeros are black leo1 raw, zeros are white leo1 decomposed, zeros are white
299 leo2 [MIPLIB] COR@L test set Instance coming from the COR@L test set with unknown origin - leo2 raw, zeros are black leo2 decomposed, zeros are black leo2 raw, zeros are white leo2 decomposed, zeros are white
300 liu [MIPLIB] X. Liu Floorplan and placement problem in the physical design of VLSI circuits - liu raw, zeros are black liu decomposed, zeros are black liu raw, zeros are white liu decomposed, zeros are white
301 loopha13 [MIPLIB] Hamideh This is a Gams model which uses CPLEX as a solver. - loopha13 raw, zeros are black loopha13 decomposed, zeros are black loopha13 raw, zeros are white loopha13 decomposed, zeros are white
302 lotsize [MIPLIB] Dinakar Gade, Simge Kucukyavuz Multi-item lot sizing with service level constraints - lotsize raw, zeros are black lotsize decomposed, zeros are black lotsize raw, zeros are white lotsize decomposed, zeros are white
303 lr1dr02vc05v8a-t360 [MIPLIB] Dimitri Papageorgiou Maritime Inventory Routing Problem Library - Group 2 Instances. These instances are available at https://mirplib.scl.gatech.edu/instances, along with a host of additional information such as the underlying data used to generate the model, best known upper and lower bounds, and more. There are three sets of 24 instances (for a total of 72 instances) with a planning horizon of 120, 180, and 360 time periods, respectively. As of March 2016, Cplex and Gurobi could only solve one or two to provably optimality in less than an hour. maritime lr1dr02vc05v8a-t360 raw, zeros are black lr1dr02vc05v8a-t360 decomposed, zeros are black lr1dr02vc05v8a-t360 raw, zeros are white lr1dr02vc05v8a-t360 decomposed, zeros are white
304 lr1dr04vc05v17a-t360 [MIPLIB] Dimitri Papageorgiou Maritime Inventory Routing Problem Library - Group 2 Instances. These instances are available at https://mirplib.scl.gatech.edu/instances, along with a host of additional information such as the underlying data used to generate the model, best known upper and lower bounds, and more. There are three sets of 24 instances (for a total of 72 instances) with a planning horizon of 120, 180, and 360 time periods, respectively. As of March 2016, Cplex and Gurobi could only solve one or two to provably optimality in less than an hour. maritime lr1dr04vc05v17a-t360 raw, zeros are black lr1dr04vc05v17a-t360 decomposed, zeros are black lr1dr04vc05v17a-t360 raw, zeros are white lr1dr04vc05v17a-t360 decomposed, zeros are white
305 lr1dr12vc10v70b-t360 [MIPLIB] Dimitri Papageorgiou Maritime Inventory Routing Problem Library - Group 2 Instances. These instances are available at https://mirplib.scl.gatech.edu/instances, along with a host of additional information such as the underlying data used to generate the model, best known upper and lower bounds, and more. There are three sets of 24 instances (for a total of 72 instances) with a planning horizon of 120, 180, and 360 time periods, respectively. As of March 2016, Cplex and Gurobi could only solve one or two to provably optimality in less than an hour. maritime lr1dr12vc10v70b-t360 raw, zeros are black lr1dr12vc10v70b-t360 decomposed, zeros are black lr1dr12vc10v70b-t360 raw, zeros are white lr1dr12vc10v70b-t360 decomposed, zeros are white
306 lr2-22dr3-333vc4v17a-t60 [MIPLIB] Dimitri Papageorgiou Maritime Inventory Routing Problem Library - Group 1 Instances. These instances are available at https://mirplib.scl.gatech.edu/instances, along with a host of additional information such as the underlying data used to generate the model, best known upper and lower bounds, and more. As of 2012, Group 1 instances gave Cplex and Gurobi tremendous difficulty finding a single feasible solution. maritime lr2-22dr3-333vc4v17a-t60 raw, zeros are black lr2-22dr3-333vc4v17a-t60 decomposed, zeros are black lr2-22dr3-333vc4v17a-t60 raw, zeros are white lr2-22dr3-333vc4v17a-t60 decomposed, zeros are white
307 lrn [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - lrn raw, zeros are black lrn decomposed, zeros are black lrn raw, zeros are white lrn decomposed, zeros are white
308 mad [MIPLIB] Koichi Fujii Mean-Absolute Deviation Model for Car Dealerships - mad raw, zeros are black mad decomposed, zeros are black mad raw, zeros are white mad decomposed, zeros are white
309 manna81 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - manna81 raw, zeros are black manna81 decomposed, zeros are black manna81 raw, zeros are white manna81 decomposed, zeros are white
310 map14860-20 [MIPLIB] Kiyan Ahmadizadeh Land parcel selection problems motivated by Red-Cockaded Woodpecker conservation problem map map14860-20 raw, zeros are black map14860-20 decomposed, zeros are black map14860-20 raw, zeros are white map14860-20 decomposed, zeros are white
311 mappingmesh3x3mpeg2i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 mapping mappingmesh3x3mpeg2i raw, zeros are black mappingmesh3x3mpeg2i decomposed, zeros are black mappingmesh3x3mpeg2i raw, zeros are white mappingmesh3x3mpeg2i decomposed, zeros are white
312 mario-t-hard5i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 mario mario-t-hard5i raw, zeros are black mario-t-hard5i decomposed, zeros are black mario-t-hard5i raw, zeros are white mario-t-hard5i decomposed, zeros are white
313 maritime-jg3d9 [MIPLIB] Dimitri Papageorgiou Maritime Inventory Routing Problems: Jiang-Grossmann Instances. These instances are available at https://mirplib.scl.gatech.edu/instances, along with a host of additional information such as the underlying data used to generate the model, best known upper and lower bounds, and more. They involve a single product maritime inventory routing problem and explore the use of continuous and discrete time models. A continuous-time model based on time slots for single docks is used for some instances. A model based on event points to handle parallel docks is used in others. A discrete time model based on a single commodity fixed-charge network flow problem (FCNF) is used for other instances. All the models are solved for multiple randomly generated instances of different problems to compare their computational efficiency. maritime maritime-jg3d9 raw, zeros are black maritime-jg3d9 decomposed, zeros are black maritime-jg3d9 raw, zeros are white maritime-jg3d9 decomposed, zeros are white
314 markshare_4_0 [MIPLIB] G. Cornuéjols, M. Dawande Market sharing problem markshare markshare_4_0 raw, zeros are black markshare_4_0 decomposed, zeros are black markshare_4_0 raw, zeros are white markshare_4_0 decomposed, zeros are white
315 markshare_5_0 [MIPLIB] G. Cornuéjols, M. Dawande Market sharing problem markshare markshare_5_0 raw, zeros are black markshare_5_0 decomposed, zeros are black markshare_5_0 raw, zeros are white markshare_5_0 decomposed, zeros are white
316 markshare1 [MIPLIB] G. Cornuéjols, M. Dawande Market sharing problem markshare markshare1 raw, zeros are black markshare1 decomposed, zeros are black markshare1 raw, zeros are white markshare1 decomposed, zeros are white
317 markshare2 [MIPLIB] G. Cornuéjols, M. Dawande Market sharing problem markshare markshare2 raw, zeros are black markshare2 decomposed, zeros are black markshare2 raw, zeros are white markshare2 decomposed, zeros are white
318 mas74 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - mas74 raw, zeros are black mas74 decomposed, zeros are black mas74 raw, zeros are white mas74 decomposed, zeros are white
319 mas76 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - mas76 raw, zeros are black mas76 decomposed, zeros are black mas76 raw, zeros are white mas76 decomposed, zeros are white
320 maxgasflow [MIPLIB] G. Gamrath Transport momentum maximization in a capacitated gas network, allowing cycles. Solved by Gurobi 5.0 in 2882 seconds (May 2012). - maxgasflow raw, zeros are black maxgasflow decomposed, zeros are black maxgasflow raw, zeros are white maxgasflow decomposed, zeros are white
321 mc8 [MIPLIB] F. Ortega, L. Wolsey Fixed cost network flow problems mc mc8 raw, zeros are black mc8 decomposed, zeros are black mc8 raw, zeros are white mc8 decomposed, zeros are white
322 mcsched [MIPLIB] Q. Chen Unknown application from COR@L - mcsched raw, zeros are black mcsched decomposed, zeros are black mcsched raw, zeros are white mcsched decomposed, zeros are white
323 mik-250-20-75-5 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. mik_250 mik-250-20-75-5 raw, zeros are black mik-250-20-75-5 decomposed, zeros are black mik-250-20-75-5 raw, zeros are white mik-250-20-75-5 decomposed, zeros are white
324 milo-v12-6-r1-58-1 [MIPLIB] Tamas Terlaky The models come from structural design optimization where the objective is to minimize the total weight of 2 and 3 dimensional cantilevers. The 2D examples are simpler, and GuRobi can solve the 40_1 and 58_1 instances, while struggles with 75_1. The 3D examples are more challenging. The x_0 and x_1 models are two different modeling of the same identical problems, so their optimal value is the same. The 1_x and 2_x problems are solved by GuRoBi, the 3_x and 4_x are not solved in reasonable time. milo milo-v12-6-r1-58-1 raw, zeros are black milo-v12-6-r1-58-1 decomposed, zeros are black milo-v12-6-r1-58-1 raw, zeros are white milo-v12-6-r1-58-1 decomposed, zeros are white
325 milo-v12-6-r1-75-1 [MIPLIB] Tamas Terlaky The models come from structural design optimization where the objective is to minimize the total weight of 2 and 3 dimensional cantilevers. The 2D examples are simpler, and GuRobi can solve the 40_1 and 58_1 instances, while struggles with 75_1. The 3D examples are more challenging. The x_0 and x_1 models are two different modeling of the same identical problems, so their optimal value is the same. The 1_x and 2_x problems are solved by GuRoBi, the 3_x and 4_x are not solved in reasonable time. milo milo-v12-6-r1-75-1 raw, zeros are black milo-v12-6-r1-75-1 decomposed, zeros are black milo-v12-6-r1-75-1 raw, zeros are white milo-v12-6-r1-75-1 decomposed, zeros are white
326 milo-v12-6-r2-40-1 [MIPLIB] Tamas Terlaky The models come from structural design optimization where the objective is to minimize the total weight of 2 and 3 dimensional cantilevers. The 2D examples are simpler, and GuRobi can solve the 40_1 and 58_1 instances, while struggles with 75_1. The 3D examples are more challenging. The x_0 and x_1 models are two different modeling of the same identical problems, so their optimal value is the same. The 1_x and 2_x problems are solved by GuRoBi, the 3_x and 4_x are not solved in reasonable time. milo milo-v12-6-r2-40-1 raw, zeros are black milo-v12-6-r2-40-1 decomposed, zeros are black milo-v12-6-r2-40-1 raw, zeros are white milo-v12-6-r2-40-1 decomposed, zeros are white
327 milo-v13-4-3d-3-0 [MIPLIB] Tamas Terlaky The models come from structural design optimization where the objective is to minimize the total weight of 2 and 3 dimensional cantilevers. The 2D examples are simpler, and GuRobi can solve the 40_1 and 58_1 instances, while struggles with 75_1. The 3D examples are more challenging. The x_0 and x_1 models are two different modeling of the same identical problems, so their optimal value is the same. The 1_x and 2_x problems are solved by GuRoBi, the 3_x and 4_x are not solved in reasonable time. milo milo-v13-4-3d-3-0 raw, zeros are black milo-v13-4-3d-3-0 decomposed, zeros are black milo-v13-4-3d-3-0 raw, zeros are white milo-v13-4-3d-3-0 decomposed, zeros are white
328 milo-v13-4-3d-4-0 [MIPLIB] Tamas Terlaky The models come from structural design optimization where the objective is to minimize the total weight of 2 and 3 dimensional cantilevers. The 2D examples are simpler, and GuRobi can solve the 40_1 and 58_1 instances, while struggles with 75_1. The 3D examples are more challenging. The x_0 and x_1 models are two different modeling of the same identical problems, so their optimal value is the same. The 1_x and 2_x problems are solved by GuRoBi, the 3_x and 4_x are not solved in reasonable time. milo milo-v13-4-3d-4-0 raw, zeros are black milo-v13-4-3d-4-0 decomposed, zeros are black milo-v13-4-3d-4-0 raw, zeros are white milo-v13-4-3d-4-0 decomposed, zeros are white
329 mine-166-5 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance mine mine-166-5 raw, zeros are black mine-166-5 decomposed, zeros are black mine-166-5 raw, zeros are white mine-166-5 decomposed, zeros are white
330 mine-90-10 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance mine mine-90-10 raw, zeros are black mine-90-10 decomposed, zeros are black mine-90-10 raw, zeros are white mine-90-10 decomposed, zeros are white
331 mining [MIPLIB] Kelly Eurek Unspecified mining application. Mark Zuckerberg suggests the following tightening of one class of constraints: The variables in this problem (except for the last one, x348921, which is fixed to 1 and does not appear in any constraint) are arranged in groups of 20, and there are three classes of precedence constraints (or more accurately, implication constraints): 1) For each variable index i=-,348920, if i mod 20 > 0 then there is a constraint x_i 2) If i mod 20 = and i>20 then there is a constraint x_i = x21 >= x41 >=-) 3) and for all other i there is a constraint x_i Graphically, we can represent the variables as a table with height twenty and width 348920 / 20, with indices 1,-,20 going down the left-most column, then 21,-,40 going down the next column to the right, etc. There is then a precedence constraint (1) from each variable in a column to the one below it, a precedence constraint (2) from the topmost entry in each column to its neighbor on the left, and an "OR" precedence constraint (3) from each entry that isn't on top of a column, requiring that if it has value 1 then either the one above it or the one to its left must have value 1 as well. But in fact this OR precedence (3) can be replaced with a simple precedence constraint from each variable to the one at its left. To see this note that in any column, the first type of precedence constraint will require that a feasible solution must be a contiguous sequence of 1's from some point in the column until the bottom. Consider column c > 1. The topmost 1 in this column, by precedence constraints (3) (or if the topmost is at the top of the column, then by precedence constraints (2)) implies that the variable to its left (in column c-1) is also 1, which implies that the contiguous sequence of 1's in column c-1 must be at least as high as the sequence in column c. Thus for every 1 in column c, the entry to its left in column c-1 must also be 1. - mining raw, zeros are black mining decomposed, zeros are black mining raw, zeros are white mining decomposed, zeros are white
332 minutedispatchstrategy [MIPLIB] Mark Husted Dispatch Strategy for a small micro-grid - minutedispatchstrategy raw, zeros are black minutedispatchstrategy decomposed, zeros are black minutedispatchstrategy raw, zeros are white minutedispatchstrategy decomposed, zeros are white
333 misc04inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. misc misc04inf raw, zeros are black misc04inf decomposed, zeros are black misc04inf raw, zeros are white misc04inf decomposed, zeros are white
334 misc05inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. misc misc05inf raw, zeros are black misc05inf decomposed, zeros are black misc05inf raw, zeros are white misc05inf decomposed, zeros are white
335 misc07 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. misc misc07 raw, zeros are black misc07 decomposed, zeros are black misc07 raw, zeros are white misc07 decomposed, zeros are white
336 mitre [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - mitre raw, zeros are black mitre decomposed, zeros are black mitre raw, zeros are white mitre decomposed, zeros are white
337 mkc [MIPLIB] J. Kalagnanam, M. Dawande Multiple knapsack problem with color constraints. John Forrest, Laszlo Ladanyi and Jayant Kalagnanam solved this instance by reformulation in 1999. - mkc raw, zeros are black mkc decomposed, zeros are black mkc raw, zeros are white mkc decomposed, zeros are white
338 mkc1 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - mkc1 raw, zeros are black mkc1 decomposed, zeros are black mkc1 raw, zeros are white mkc1 decomposed, zeros are white
339 mod008inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. mod mod008inf raw, zeros are black mod008inf decomposed, zeros are black mod008inf raw, zeros are white mod008inf decomposed, zeros are white
340 mod010 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. mod mod010 raw, zeros are black mod010 decomposed, zeros are black mod010 raw, zeros are white mod010 decomposed, zeros are white
341 mod011 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. mod mod011 raw, zeros are black mod011 decomposed, zeros are black mod011 raw, zeros are white mod011 decomposed, zeros are white
342 moj-mining [MIPLIB] Alexandra M. Newman open pit mine production scheduling problem with inventory - moj-mining raw, zeros are black moj-mining decomposed, zeros are black moj-mining raw, zeros are white moj-mining decomposed, zeros are white
343 momentum1 [MIPLIB] T. Koch Snapshot based UMTS planning problem, having a very wide dynamic range in the matrix coefficients and tending to be numerically unstable. Solved with Gurobi 4.5.1 on a 12-core Linux system in 3590.41 sec. momentum momentum1 raw, zeros are black momentum1 decomposed, zeros are black momentum1 raw, zeros are white momentum1 decomposed, zeros are white
344 momentum2 [MIPLIB] T. Koch Snapshot based UMTS planning problem, having a very wide dynamic range in the matrix coefficients and tending to be numerically unstable momentum momentum2 raw, zeros are black momentum2 decomposed, zeros are black momentum2 raw, zeros are white momentum2 decomposed, zeros are white
345 momentum3 [MIPLIB] T. Koch Snapshot based UMTS planning problem, having a very wide dynamic range in the matrix coefficients and tending to be numerically unstable momentum momentum3 raw, zeros are black momentum3 decomposed, zeros are black momentum3 raw, zeros are white momentum3 decomposed, zeros are white
346 mrcpspj30-15-5i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 mrcpspj mrcpspj30-15-5i raw, zeros are black mrcpspj30-15-5i decomposed, zeros are black mrcpspj30-15-5i raw, zeros are white mrcpspj30-15-5i decomposed, zeros are white
347 mrcpspj30-17-10i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 mrcpspj mrcpspj30-17-10i raw, zeros are black mrcpspj30-17-10i decomposed, zeros are black mrcpspj30-17-10i raw, zeros are white mrcpspj30-17-10i decomposed, zeros are white
348 mrcpspj30-53-3i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 mrcpspj mrcpspj30-53-3i raw, zeros are black mrcpspj30-53-3i decomposed, zeros are black mrcpspj30-53-3i raw, zeros are white mrcpspj30-53-3i decomposed, zeros are white
349 msc98-ip [MIPLIB] E-Plus, D. Bienstock, A. Bley, R. Wessäly Min-cost network dimensioning problems with a finite set of link capacities for each bidirected link, unsplittable shortest path routing, path restoration for single node failures, and routing path length restrictions - msc98-ip raw, zeros are black msc98-ip decomposed, zeros are black msc98-ip raw, zeros are white msc98-ip decomposed, zeros are white
350 mspsphard01i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 mspsp mspsphard01i raw, zeros are black mspsphard01i decomposed, zeros are black mspsphard01i raw, zeros are white mspsphard01i decomposed, zeros are white
351 mspsphard03i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 mspsp mspsphard03i raw, zeros are black mspsphard03i decomposed, zeros are black mspsphard03i raw, zeros are white mspsphard03i decomposed, zeros are white
352 mtest4ma [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - mtest4ma raw, zeros are black mtest4ma decomposed, zeros are black mtest4ma raw, zeros are white mtest4ma decomposed, zeros are white
353 mushroom-best [MIPLIB] Berk Ustun MIP to create optimized data-driven scoring systems. See: https://github.com/ustunb/miplib2017-slim#miplib2017-slim for a description. ustun mushroom-best raw, zeros are black mushroom-best decomposed, zeros are black mushroom-best raw, zeros are white mushroom-best decomposed, zeros are white
354 mzzv11 [MIPLIB] S. Lukac Railway slot allocation problems - mzzv11 raw, zeros are black mzzv11 decomposed, zeros are black mzzv11 raw, zeros are white mzzv11 decomposed, zeros are white
355 mzzv42z [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - mzzv42z raw, zeros are black mzzv42z decomposed, zeros are black mzzv42z raw, zeros are white mzzv42z decomposed, zeros are white
356 n13-3 [MIPLIB] A. Atamtürk Capacitated network design problem nxy-z n13-3 raw, zeros are black n13-3 decomposed, zeros are black n13-3 raw, zeros are white n13-3 decomposed, zeros are white
357 n2seq36f [MIPLIB] R. Meirich Static line planning models on the Dutch IC network nseq n2seq36f raw, zeros are black n2seq36f decomposed, zeros are black n2seq36f raw, zeros are white n2seq36f decomposed, zeros are white
358 n2seq36q [MIPLIB] R. Meirich Static line planning models on the Dutch IC network nseq n2seq36q raw, zeros are black n2seq36q decomposed, zeros are black n2seq36q raw, zeros are white n2seq36q decomposed, zeros are white
359 n3707 [MIPLIB] J. Aronson Fixed charge transportation problem n37 n3707 raw, zeros are black n3707 decomposed, zeros are black n3707 raw, zeros are white n3707 decomposed, zeros are white
360 n3div36 [MIPLIB] R. Meirich Static line planning models on the Dutch IC network. Solved with Gurobi 4.5.1 on a 12-core Linux system in 1700.37 sec. nseq n3div36 raw, zeros are black n3div36 decomposed, zeros are black n3div36 raw, zeros are white n3div36 decomposed, zeros are white
361 n3seq24 [MIPLIB] R. Meirich Static line planning models on the Dutch IC network nseq n3seq24 raw, zeros are black n3seq24 decomposed, zeros are black n3seq24 raw, zeros are white n3seq24 decomposed, zeros are white
362 n5-3 [MIPLIB] A. Atamtürk Capacitated network design problem nxy-z n5-3 raw, zeros are black n5-3 decomposed, zeros are black n5-3 raw, zeros are white n5-3 decomposed, zeros are white
363 n6-3 [MIPLIB] A. Atamtürk Capacitated network design problem nxy-z n6-3 raw, zeros are black n6-3 decomposed, zeros are black n6-3 raw, zeros are white n6-3 decomposed, zeros are white
364 n7-3 [MIPLIB] A. Atamtürk Capacitated network design problem nxy-z n7-3 raw, zeros are black n7-3 decomposed, zeros are black n7-3 raw, zeros are white n7-3 decomposed, zeros are white
365 n9-3 [MIPLIB] A. Atamtürk Capacitated network design problem nxy-z n9-3 raw, zeros are black n9-3 decomposed, zeros are black n9-3 raw, zeros are white n9-3 decomposed, zeros are white
366 nag [MIPLIB] N. Shenoy Unknown Application from COR@L - nag raw, zeros are black nag decomposed, zeros are black nag raw, zeros are white nag decomposed, zeros are white
367 nb10tb [MIPLIB] Serge Bisaillon Forestry industry model - nb10tb raw, zeros are black nb10tb decomposed, zeros are black nb10tb raw, zeros are white nb10tb decomposed, zeros are white
368 neos-1061020 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-11 neos-1061020 raw, zeros are black neos-1061020 decomposed, zeros are black neos-1061020 raw, zeros are white neos-1061020 decomposed, zeros are white
369 neos-1067731 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-11 neos-1067731 raw, zeros are black neos-1067731 decomposed, zeros are black neos-1067731 raw, zeros are white neos-1067731 decomposed, zeros are white
370 neos-1112782 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-89 neos-1112782 raw, zeros are black neos-1112782 decomposed, zeros are black neos-1112782 raw, zeros are white neos-1112782 decomposed, zeros are white
371 neos-1112787 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-89 neos-1112787 raw, zeros are black neos-1112787 decomposed, zeros are black neos-1112787 raw, zeros are white neos-1112787 decomposed, zeros are white
372 neos-1122047 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-46 neos-1122047 raw, zeros are black neos-1122047 decomposed, zeros are black neos-1122047 raw, zeros are white neos-1122047 decomposed, zeros are white
373 neos-1140050 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application. Infeasibility claimed by CPLEX 12.6 and CPLEX 12.6.1 with extreme numerical caution emphasi after 4 and 2 hours computation, respectively. neos-pseudoapplication-101 neos-1140050 raw, zeros are black neos-1140050 decomposed, zeros are black neos-1140050 raw, zeros are white neos-1140050 decomposed, zeros are white
374 neos-1171448 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-8 neos-1171448 raw, zeros are black neos-1171448 decomposed, zeros are black neos-1171448 raw, zeros are white neos-1171448 decomposed, zeros are white
375 neos-1171737 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-80 neos-1171737 raw, zeros are black neos-1171737 decomposed, zeros are black neos-1171737 raw, zeros are white neos-1171737 decomposed, zeros are white
376 neos-1223462 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-12 neos-1223462 raw, zeros are black neos-1223462 decomposed, zeros are black neos-1223462 raw, zeros are white neos-1223462 decomposed, zeros are white
377 neos-1324574 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-99 neos-1324574 raw, zeros are black neos-1324574 decomposed, zeros are black neos-1324574 raw, zeros are white neos-1324574 decomposed, zeros are white
378 neos-1330346 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-49 neos-1330346 raw, zeros are black neos-1330346 decomposed, zeros are black neos-1330346 raw, zeros are white neos-1330346 decomposed, zeros are white
379 neos-1337307 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-13 neos-1337307 raw, zeros are black neos-1337307 decomposed, zeros are black neos-1337307 raw, zeros are white neos-1337307 decomposed, zeros are white
380 neos-1354092 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-47 neos-1354092 raw, zeros are black neos-1354092 decomposed, zeros are black neos-1354092 raw, zeros are white neos-1354092 decomposed, zeros are white
381 neos-1367061 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-76 neos-1367061 raw, zeros are black neos-1367061 decomposed, zeros are black neos-1367061 raw, zeros are white neos-1367061 decomposed, zeros are white
382 neos-1396125 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-96 neos-1396125 raw, zeros are black neos-1396125 decomposed, zeros are black neos-1396125 raw, zeros are white neos-1396125 decomposed, zeros are white
383 neos-1420546 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-9 neos-1420546 raw, zeros are black neos-1420546 decomposed, zeros are black neos-1420546 raw, zeros are white neos-1420546 decomposed, zeros are white
384 neos-1420790 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-9 neos-1420790 raw, zeros are black neos-1420790 decomposed, zeros are black neos-1420790 raw, zeros are white neos-1420790 decomposed, zeros are white
385 neos-1423785 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-98 neos-1423785 raw, zeros are black neos-1423785 decomposed, zeros are black neos-1423785 raw, zeros are white neos-1423785 decomposed, zeros are white
386 neos-1425699 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-37 neos-1425699 raw, zeros are black neos-1425699 decomposed, zeros are black neos-1425699 raw, zeros are white neos-1425699 decomposed, zeros are white
387 neos-1430701 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-8 neos-1430701 raw, zeros are black neos-1430701 decomposed, zeros are black neos-1430701 raw, zeros are white neos-1430701 decomposed, zeros are white
388 neos-1442119 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-8 neos-1442119 raw, zeros are black neos-1442119 decomposed, zeros are black neos-1442119 raw, zeros are white neos-1442119 decomposed, zeros are white
389 neos-1445532 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-88 neos-1445532 raw, zeros are black neos-1445532 decomposed, zeros are black neos-1445532 raw, zeros are white neos-1445532 decomposed, zeros are white
390 neos-1445738 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-88 neos-1445738 raw, zeros are black neos-1445738 decomposed, zeros are black neos-1445738 raw, zeros are white neos-1445738 decomposed, zeros are white
391 neos-1445743 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-88 neos-1445743 raw, zeros are black neos-1445743 decomposed, zeros are black neos-1445743 raw, zeros are white neos-1445743 decomposed, zeros are white
392 neos-1445765 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-88 neos-1445765 raw, zeros are black neos-1445765 decomposed, zeros are black neos-1445765 raw, zeros are white neos-1445765 decomposed, zeros are white
393 neos-1456979 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-102 neos-1456979 raw, zeros are black neos-1456979 decomposed, zeros are black neos-1456979 raw, zeros are white neos-1456979 decomposed, zeros are white
394 neos-1516309 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-26 neos-1516309 raw, zeros are black neos-1516309 decomposed, zeros are black neos-1516309 raw, zeros are white neos-1516309 decomposed, zeros are white
395 neos-1582420 [MIPLIB] NEOS Server Submission Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-10 neos-1582420 raw, zeros are black neos-1582420 decomposed, zeros are black neos-1582420 raw, zeros are white neos-1582420 decomposed, zeros are white
396 neos-1593097 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-77 neos-1593097 raw, zeros are black neos-1593097 decomposed, zeros are black neos-1593097 raw, zeros are white neos-1593097 decomposed, zeros are white
397 neos-1599274 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-26 neos-1599274 raw, zeros are black neos-1599274 decomposed, zeros are black neos-1599274 raw, zeros are white neos-1599274 decomposed, zeros are white
398 neos-1601936 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-5 neos-1601936 raw, zeros are black neos-1601936 decomposed, zeros are black neos-1601936 raw, zeros are white neos-1601936 decomposed, zeros are white
399 neos-1603965 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-35 neos-1603965 raw, zeros are black neos-1603965 decomposed, zeros are black neos-1603965 raw, zeros are white neos-1603965 decomposed, zeros are white
400 neos-1605061 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-5 neos-1605061 raw, zeros are black neos-1605061 decomposed, zeros are black neos-1605061 raw, zeros are white neos-1605061 decomposed, zeros are white
401 neos-2075418-temuka [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-62 neos-2075418-temuka raw, zeros are black neos-2075418-temuka decomposed, zeros are black neos-2075418-temuka raw, zeros are white neos-2075418-temuka decomposed, zeros are white
402 neos-2294525-abba [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-46 neos-2294525-abba raw, zeros are black neos-2294525-abba decomposed, zeros are black neos-2294525-abba raw, zeros are white neos-2294525-abba decomposed, zeros are white
403 neos-2328163-agri [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-36 neos-2328163-agri raw, zeros are black neos-2328163-agri decomposed, zeros are black neos-2328163-agri raw, zeros are white neos-2328163-agri decomposed, zeros are white
404 neos-2624317-amur [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-7 neos-2624317-amur raw, zeros are black neos-2624317-amur decomposed, zeros are black neos-2624317-amur raw, zeros are white neos-2624317-amur decomposed, zeros are white
405 neos-2626858-aoos [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-7 neos-2626858-aoos raw, zeros are black neos-2626858-aoos decomposed, zeros are black neos-2626858-aoos raw, zeros are white neos-2626858-aoos decomposed, zeros are white
406 neos-2629914-sudost [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-66 neos-2629914-sudost raw, zeros are black neos-2629914-sudost decomposed, zeros are black neos-2629914-sudost raw, zeros are white neos-2629914-sudost decomposed, zeros are white
407 neos-2652786-brda [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-7 neos-2652786-brda raw, zeros are black neos-2652786-brda decomposed, zeros are black neos-2652786-brda raw, zeros are white neos-2652786-brda decomposed, zeros are white
408 neos-2656603-coxs [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-7 neos-2656603-coxs raw, zeros are black neos-2656603-coxs decomposed, zeros are black neos-2656603-coxs raw, zeros are white neos-2656603-coxs decomposed, zeros are white
409 neos-2657525-crna [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-7 neos-2657525-crna raw, zeros are black neos-2657525-crna decomposed, zeros are black neos-2657525-crna raw, zeros are white neos-2657525-crna decomposed, zeros are white
410 neos-2669500-cust [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-52 neos-2669500-cust raw, zeros are black neos-2669500-cust decomposed, zeros are black neos-2669500-cust raw, zeros are white neos-2669500-cust decomposed, zeros are white
411 neos-2746589-doon [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-52 neos-2746589-doon raw, zeros are black neos-2746589-doon decomposed, zeros are black neos-2746589-doon raw, zeros are white neos-2746589-doon decomposed, zeros are white
412 neos-2974461-ibar [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-45 neos-2974461-ibar raw, zeros are black neos-2974461-ibar decomposed, zeros are black neos-2974461-ibar raw, zeros are white neos-2974461-ibar decomposed, zeros are white
413 neos-2978193-inde [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-5 neos-2978193-inde raw, zeros are black neos-2978193-inde decomposed, zeros are black neos-2978193-inde raw, zeros are white neos-2978193-inde decomposed, zeros are white
414 neos-2978205-isar [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-77 neos-2978205-isar raw, zeros are black neos-2978205-isar decomposed, zeros are black neos-2978205-isar raw, zeros are white neos-2978205-isar decomposed, zeros are white
415 neos-2987202-jeir [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-82 neos-2987202-jeir raw, zeros are black neos-2987202-jeir decomposed, zeros are black neos-2987202-jeir raw, zeros are white neos-2987202-jeir decomposed, zeros are white
416 neos-2987310-joes [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-82 neos-2987310-joes raw, zeros are black neos-2987310-joes decomposed, zeros are black neos-2987310-joes raw, zeros are white neos-2987310-joes decomposed, zeros are white
417 neos-2991472-kalu [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-77 neos-2991472-kalu raw, zeros are black neos-2991472-kalu decomposed, zeros are black neos-2991472-kalu raw, zeros are white neos-2991472-kalu decomposed, zeros are white
418 neos-3004026-krka [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-38 neos-3004026-krka raw, zeros are black neos-3004026-krka decomposed, zeros are black neos-3004026-krka raw, zeros are white neos-3004026-krka decomposed, zeros are white
419 neos-3009394-lami [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-90 neos-3009394-lami raw, zeros are black neos-3009394-lami decomposed, zeros are black neos-3009394-lami raw, zeros are white neos-3009394-lami decomposed, zeros are white
420 neos-3024952-loue [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-86 neos-3024952-loue raw, zeros are black neos-3024952-loue decomposed, zeros are black neos-3024952-loue raw, zeros are white neos-3024952-loue decomposed, zeros are white
421 neos-3025225-shelon [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-64 neos-3025225-shelon raw, zeros are black neos-3025225-shelon decomposed, zeros are black neos-3025225-shelon raw, zeros are white neos-3025225-shelon decomposed, zeros are white
422 neos-3045796-mogo [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-22 neos-3045796-mogo raw, zeros are black neos-3045796-mogo decomposed, zeros are black neos-3045796-mogo raw, zeros are white neos-3045796-mogo decomposed, zeros are white
423 neos-3046601-motu [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-90 neos-3046601-motu raw, zeros are black neos-3046601-motu decomposed, zeros are black neos-3046601-motu raw, zeros are white neos-3046601-motu decomposed, zeros are white
424 neos-3046615-murg [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-90 neos-3046615-murg raw, zeros are black neos-3046615-murg decomposed, zeros are black neos-3046615-murg raw, zeros are white neos-3046615-murg decomposed, zeros are white
425 neos-3048764-nadi [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-43 neos-3048764-nadi raw, zeros are black neos-3048764-nadi decomposed, zeros are black neos-3048764-nadi raw, zeros are white neos-3048764-nadi decomposed, zeros are white
426 neos-3065804-namu [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-41 neos-3065804-namu raw, zeros are black neos-3065804-namu decomposed, zeros are black neos-3065804-namu raw, zeros are white neos-3065804-namu decomposed, zeros are white
427 neos-3068746-nene [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-45 neos-3068746-nene raw, zeros are black neos-3068746-nene decomposed, zeros are black neos-3068746-nene raw, zeros are white neos-3068746-nene decomposed, zeros are white
428 neos-3072252-nete [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-50 neos-3072252-nete raw, zeros are black neos-3072252-nete decomposed, zeros are black neos-3072252-nete raw, zeros are white neos-3072252-nete decomposed, zeros are white
429 neos-3075395-nile [MIPLIB] Jeff Linderoth Solved using SCIP 6.0.1 in less than 4 seconds. neos-pseudoapplication-50 neos-3075395-nile raw, zeros are black neos-3075395-nile decomposed, zeros are black neos-3075395-nile raw, zeros are white neos-3075395-nile decomposed, zeros are white
430 neos-3083784-nive [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-72 neos-3083784-nive raw, zeros are black neos-3083784-nive decomposed, zeros are black neos-3083784-nive raw, zeros are white neos-3083784-nive decomposed, zeros are white
431 neos-3083819-nubu [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-31 neos-3083819-nubu raw, zeros are black neos-3083819-nubu decomposed, zeros are black neos-3083819-nubu raw, zeros are white neos-3083819-nubu decomposed, zeros are white
432 neos-3116779-oban [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-26 neos-3116779-oban raw, zeros are black neos-3116779-oban decomposed, zeros are black neos-3116779-oban raw, zeros are white neos-3116779-oban decomposed, zeros are white
433 neos-3118745-obra [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-26 neos-3118745-obra raw, zeros are black neos-3118745-obra decomposed, zeros are black neos-3118745-obra raw, zeros are white neos-3118745-obra decomposed, zeros are white
434 neos-3135526-osun [MIPLIB] Jeff Linderoth Claimed infeasible by most solvers. neos-pseudoapplication-71 neos-3135526-osun raw, zeros are black neos-3135526-osun decomposed, zeros are black neos-3135526-osun raw, zeros are white neos-3135526-osun decomposed, zeros are white
435 neos-3148108-pahi [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-49 neos-3148108-pahi raw, zeros are black neos-3148108-pahi decomposed, zeros are black neos-3148108-pahi raw, zeros are white neos-3148108-pahi decomposed, zeros are white
436 neos-3209462-rhin [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-98 neos-3209462-rhin raw, zeros are black neos-3209462-rhin decomposed, zeros are black neos-3209462-rhin raw, zeros are white neos-3209462-rhin decomposed, zeros are white
437 neos-3209519-ruhr [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-14 neos-3209519-ruhr raw, zeros are black neos-3209519-ruhr decomposed, zeros are black neos-3209519-ruhr raw, zeros are white neos-3209519-ruhr decomposed, zeros are white
438 neos-3211096-shag [MIPLIB] Jeff Linderoth Solved with status infeasible by ParaSCIP in 42484 sec.\xa0It was confirmed by ParaXpress. neos-pseudoapplication-38 neos-3211096-shag raw, zeros are black neos-3211096-shag decomposed, zeros are black neos-3211096-shag raw, zeros are white neos-3211096-shag decomposed, zeros are white
439 neos-3214367-sovi [MIPLIB] Jeff Linderoth Solved in 21 days with four restarted runs of ParaXpress. neos-pseudoapplication-56 neos-3214367-sovi raw, zeros are black neos-3214367-sovi decomposed, zeros are black neos-3214367-sovi raw, zeros are white neos-3214367-sovi decomposed, zeros are white
440 neos-3216931-puriri [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-56 neos-3216931-puriri raw, zeros are black neos-3216931-puriri decomposed, zeros are black neos-3216931-puriri raw, zeros are white neos-3216931-puriri decomposed, zeros are white
441 neos-3218348-suir [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-72 neos-3218348-suir raw, zeros are black neos-3218348-suir decomposed, zeros are black neos-3218348-suir raw, zeros are white neos-3218348-suir decomposed, zeros are white
442 neos-3226448-wkra [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-103 neos-3226448-wkra raw, zeros are black neos-3226448-wkra decomposed, zeros are black neos-3226448-wkra raw, zeros are white neos-3226448-wkra decomposed, zeros are white
443 neos-3230376-yser [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-4 neos-3230376-yser raw, zeros are black neos-3230376-yser decomposed, zeros are black neos-3230376-yser raw, zeros are white neos-3230376-yser decomposed, zeros are white
444 neos-3230516-zala [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-4 neos-3230516-zala raw, zeros are black neos-3230516-zala decomposed, zeros are black neos-3230516-zala raw, zeros are white neos-3230516-zala decomposed, zeros are white
445 neos-3237086-abava [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-51 neos-3237086-abava raw, zeros are black neos-3237086-abava decomposed, zeros are black neos-3237086-abava raw, zeros are white neos-3237086-abava decomposed, zeros are white
446 neos-3283608-agout [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-84 neos-3283608-agout raw, zeros are black neos-3283608-agout decomposed, zeros are black neos-3283608-agout raw, zeros are white neos-3283608-agout decomposed, zeros are white
447 neos-3322547-alsek [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-77 neos-3322547-alsek raw, zeros are black neos-3322547-alsek decomposed, zeros are black neos-3322547-alsek raw, zeros are white neos-3322547-alsek decomposed, zeros are white
448 neos-3352863-ancoa [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-100 neos-3352863-ancoa raw, zeros are black neos-3352863-ancoa decomposed, zeros are black neos-3352863-ancoa raw, zeros are white neos-3352863-ancoa decomposed, zeros are white
449 neos-3355120-tarago [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-52 neos-3355120-tarago raw, zeros are black neos-3355120-tarago decomposed, zeros are black neos-3355120-tarago raw, zeros are white neos-3355120-tarago decomposed, zeros are white
450 neos-3355323-arnon [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-38 neos-3355323-arnon raw, zeros are black neos-3355323-arnon decomposed, zeros are black neos-3355323-arnon raw, zeros are white neos-3355323-arnon decomposed, zeros are white
451 neos-3372571-onahau [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-93 neos-3372571-onahau raw, zeros are black neos-3372571-onahau decomposed, zeros are black neos-3372571-onahau raw, zeros are white neos-3372571-onahau decomposed, zeros are white
452 neos-3373491-avoca [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-37 neos-3373491-avoca raw, zeros are black neos-3373491-avoca decomposed, zeros are black neos-3373491-avoca raw, zeros are white neos-3373491-avoca decomposed, zeros are white
453 neos-3381206-awhea [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-105 neos-3381206-awhea raw, zeros are black neos-3381206-awhea decomposed, zeros are black neos-3381206-awhea raw, zeros are white neos-3381206-awhea decomposed, zeros are white
454 neos-3402294-bobin [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-71 neos-3402294-bobin raw, zeros are black neos-3402294-bobin decomposed, zeros are black neos-3402294-bobin raw, zeros are white neos-3402294-bobin decomposed, zeros are white
455 neos-3421095-cinca [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-25 neos-3421095-cinca raw, zeros are black neos-3421095-cinca decomposed, zeros are black neos-3421095-cinca raw, zeros are white neos-3421095-cinca decomposed, zeros are white
456 neos-3426085-ticino [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-105 neos-3426085-ticino raw, zeros are black neos-3426085-ticino decomposed, zeros are black neos-3426085-ticino raw, zeros are white neos-3426085-ticino decomposed, zeros are white
457 neos-3426132-dieze [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-105 neos-3426132-dieze raw, zeros are black neos-3426132-dieze decomposed, zeros are black neos-3426132-dieze raw, zeros are white neos-3426132-dieze decomposed, zeros are white
458 neos-3437289-erdre [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-87 neos-3437289-erdre raw, zeros are black neos-3437289-erdre decomposed, zeros are black neos-3437289-erdre raw, zeros are white neos-3437289-erdre decomposed, zeros are white
459 neos-3530903-gauja [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-105 neos-3530903-gauja raw, zeros are black neos-3530903-gauja decomposed, zeros are black neos-3530903-gauja raw, zeros are white neos-3530903-gauja decomposed, zeros are white
460 neos-3530905-gaula [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-105 neos-3530905-gaula raw, zeros are black neos-3530905-gaula decomposed, zeros are black neos-3530905-gaula raw, zeros are white neos-3530905-gaula decomposed, zeros are white
461 neos-3555904-turama [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-81 neos-3555904-turama raw, zeros are black neos-3555904-turama decomposed, zeros are black neos-3555904-turama raw, zeros are white neos-3555904-turama decomposed, zeros are white
462 neos-3572885-glina [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-38 neos-3572885-glina raw, zeros are black neos-3572885-glina decomposed, zeros are black neos-3572885-glina raw, zeros are white neos-3572885-glina decomposed, zeros are white
463 neos-3581454-haast [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-14 neos-3581454-haast raw, zeros are black neos-3581454-haast decomposed, zeros are black neos-3581454-haast raw, zeros are white neos-3581454-haast decomposed, zeros are white
464 neos-3592146-hawea [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-37 neos-3592146-hawea raw, zeros are black neos-3592146-hawea decomposed, zeros are black neos-3592146-hawea raw, zeros are white neos-3592146-hawea decomposed, zeros are white
465 neos-3594536-henty [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-83 neos-3594536-henty raw, zeros are black neos-3594536-henty decomposed, zeros are black neos-3594536-henty raw, zeros are white neos-3594536-henty decomposed, zeros are white
466 neos-3603137-hoteo [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-38 neos-3603137-hoteo raw, zeros are black neos-3603137-hoteo decomposed, zeros are black neos-3603137-hoteo raw, zeros are white neos-3603137-hoteo decomposed, zeros are white
467 neos-3610040-iskar [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-91 neos-3610040-iskar raw, zeros are black neos-3610040-iskar decomposed, zeros are black neos-3610040-iskar raw, zeros are white neos-3610040-iskar decomposed, zeros are white
468 neos-3610051-istra [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-91 neos-3610051-istra raw, zeros are black neos-3610051-istra decomposed, zeros are black neos-3610051-istra raw, zeros are white neos-3610051-istra decomposed, zeros are white
469 neos-3610173-itata [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-91 neos-3610173-itata raw, zeros are black neos-3610173-itata decomposed, zeros are black neos-3610173-itata raw, zeros are white neos-3610173-itata decomposed, zeros are white
470 neos-3611447-jijia [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-91 neos-3611447-jijia raw, zeros are black neos-3611447-jijia decomposed, zeros are black neos-3611447-jijia raw, zeros are white neos-3611447-jijia decomposed, zeros are white
471 neos-3611689-kaihu [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-91 neos-3611689-kaihu raw, zeros are black neos-3611689-kaihu decomposed, zeros are black neos-3611689-kaihu raw, zeros are white neos-3611689-kaihu decomposed, zeros are white
472 neos-3615091-sutlej [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-45 neos-3615091-sutlej raw, zeros are black neos-3615091-sutlej decomposed, zeros are black neos-3615091-sutlej raw, zeros are white neos-3615091-sutlej decomposed, zeros are white
473 neos-3627168-kasai [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-25 neos-3627168-kasai raw, zeros are black neos-3627168-kasai decomposed, zeros are black neos-3627168-kasai raw, zeros are white neos-3627168-kasai decomposed, zeros are white
474 neos-3631363-vilnia [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization Infeasibility reported by ParaSCIP in 4632 sec, confirmed by ParaXpress. neos-pseudoapplication-12 neos-3631363-vilnia raw, zeros are black neos-3631363-vilnia decomposed, zeros are black neos-3631363-vilnia raw, zeros are white neos-3631363-vilnia decomposed, zeros are white
475 neos-3634244-kauru [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-110 neos-3634244-kauru raw, zeros are black neos-3634244-kauru decomposed, zeros are black neos-3634244-kauru raw, zeros are white neos-3634244-kauru decomposed, zeros are white
476 neos-3636886-kereu [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-45 neos-3636886-kereu raw, zeros are black neos-3636886-kereu decomposed, zeros are black neos-3636886-kereu raw, zeros are white neos-3636886-kereu decomposed, zeros are white
477 neos-3654993-kolva [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-44 neos-3654993-kolva raw, zeros are black neos-3654993-kolva decomposed, zeros are black neos-3654993-kolva raw, zeros are white neos-3654993-kolva decomposed, zeros are white
478 neos-3656078-kumeu [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-44 neos-3656078-kumeu raw, zeros are black neos-3656078-kumeu decomposed, zeros are black neos-3656078-kumeu raw, zeros are white neos-3656078-kumeu decomposed, zeros are white
479 neos-3660371-kurow [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-9 neos-3660371-kurow raw, zeros are black neos-3660371-kurow decomposed, zeros are black neos-3660371-kurow raw, zeros are white neos-3660371-kurow decomposed, zeros are white
480 neos-3661949-lesse [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-11 neos-3661949-lesse raw, zeros are black neos-3661949-lesse decomposed, zeros are black neos-3661949-lesse raw, zeros are white neos-3661949-lesse decomposed, zeros are white
481 neos-3665875-lesum [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-9 neos-3665875-lesum raw, zeros are black neos-3665875-lesum decomposed, zeros are black neos-3665875-lesum raw, zeros are white neos-3665875-lesum decomposed, zeros are white
482 neos-3672928-linge [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-97 neos-3672928-linge raw, zeros are black neos-3672928-linge decomposed, zeros are black neos-3672928-linge raw, zeros are white neos-3672928-linge decomposed, zeros are white
483 neos-3682128-sandon [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-10 neos-3682128-sandon raw, zeros are black neos-3682128-sandon decomposed, zeros are black neos-3682128-sandon raw, zeros are white neos-3682128-sandon decomposed, zeros are white
484 neos-3691541-lonja [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-13 neos-3691541-lonja raw, zeros are black neos-3691541-lonja decomposed, zeros are black neos-3691541-lonja raw, zeros are white neos-3691541-lonja decomposed, zeros are white
485 neos-3695882-vesdre [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-71 neos-3695882-vesdre raw, zeros are black neos-3695882-vesdre decomposed, zeros are black neos-3695882-vesdre raw, zeros are white neos-3695882-vesdre decomposed, zeros are white
486 neos-3696678-lyvia [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-56 neos-3696678-lyvia raw, zeros are black neos-3696678-lyvia decomposed, zeros are black neos-3696678-lyvia raw, zeros are white neos-3696678-lyvia decomposed, zeros are white
487 neos-3699044-maipo [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-63 neos-3699044-maipo raw, zeros are black neos-3699044-maipo decomposed, zeros are black neos-3699044-maipo raw, zeros are white neos-3699044-maipo decomposed, zeros are white
488 neos-3699377-maori [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-3 neos-3699377-maori raw, zeros are black neos-3699377-maori decomposed, zeros are black neos-3699377-maori raw, zeros are white neos-3699377-maori decomposed, zeros are white
489 neos-3703351-marne [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-3 neos-3703351-marne raw, zeros are black neos-3703351-marne decomposed, zeros are black neos-3703351-marne raw, zeros are white neos-3703351-marne decomposed, zeros are white
490 neos-3709489-menik [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-44 neos-3709489-menik raw, zeros are black neos-3709489-menik decomposed, zeros are black neos-3709489-menik raw, zeros are white neos-3709489-menik decomposed, zeros are white
491 neos-3734794-moppy [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-25 neos-3734794-moppy raw, zeros are black neos-3734794-moppy decomposed, zeros are black neos-3734794-moppy raw, zeros are white neos-3734794-moppy decomposed, zeros are white
492 neos-3754224-navua [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-83 neos-3754224-navua raw, zeros are black neos-3754224-navua decomposed, zeros are black neos-3754224-navua raw, zeros are white neos-3754224-navua decomposed, zeros are white
493 neos-3754480-nidda [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-107 neos-3754480-nidda raw, zeros are black neos-3754480-nidda decomposed, zeros are black neos-3754480-nidda raw, zeros are white neos-3754480-nidda decomposed, zeros are white
494 neos-3755335-nizao [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-61 neos-3755335-nizao raw, zeros are black neos-3755335-nizao decomposed, zeros are black neos-3755335-nizao raw, zeros are white neos-3755335-nizao decomposed, zeros are white
495 neos-3759587-noosa [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-61 neos-3759587-noosa raw, zeros are black neos-3759587-noosa decomposed, zeros are black neos-3759587-noosa raw, zeros are white neos-3759587-noosa decomposed, zeros are white
496 neos-3761878-oglio [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-3 neos-3761878-oglio raw, zeros are black neos-3761878-oglio decomposed, zeros are black neos-3761878-oglio raw, zeros are white neos-3761878-oglio decomposed, zeros are white
497 neos-3762025-ognon [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-3 neos-3762025-ognon raw, zeros are black neos-3762025-ognon decomposed, zeros are black neos-3762025-ognon raw, zeros are white neos-3762025-ognon decomposed, zeros are white
498 neos-3988577-wolgan [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-64 neos-3988577-wolgan raw, zeros are black neos-3988577-wolgan decomposed, zeros are black neos-3988577-wolgan raw, zeros are white neos-3988577-wolgan decomposed, zeros are white
499 neos-4165869-wannon [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-44 neos-4165869-wannon raw, zeros are black neos-4165869-wannon decomposed, zeros are black neos-4165869-wannon raw, zeros are white neos-4165869-wannon decomposed, zeros are white
500 neos-4230265-orari [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-57 neos-4230265-orari raw, zeros are black neos-4230265-orari decomposed, zeros are black neos-4230265-orari raw, zeros are white neos-4230265-orari decomposed, zeros are white
501 neos-4232544-orira [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-57 neos-4232544-orira raw, zeros are black neos-4232544-orira decomposed, zeros are black neos-4232544-orira raw, zeros are white neos-4232544-orira decomposed, zeros are white
502 neos-4260495-otere [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-30 neos-4260495-otere raw, zeros are black neos-4260495-otere decomposed, zeros are black neos-4260495-otere raw, zeros are white neos-4260495-otere decomposed, zeros are white
503 neos-4264598-oueme [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-57 neos-4264598-oueme raw, zeros are black neos-4264598-oueme decomposed, zeros are black neos-4264598-oueme raw, zeros are white neos-4264598-oueme decomposed, zeros are white
504 neos-4290317-perth [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-76 neos-4290317-perth raw, zeros are black neos-4290317-perth decomposed, zeros are black neos-4290317-perth raw, zeros are white neos-4290317-perth decomposed, zeros are white
505 neos-4292145-piako [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-57 neos-4292145-piako raw, zeros are black neos-4292145-piako decomposed, zeros are black neos-4292145-piako raw, zeros are white neos-4292145-piako decomposed, zeros are white
506 neos-4295773-pissa [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-6 neos-4295773-pissa raw, zeros are black neos-4295773-pissa decomposed, zeros are black neos-4295773-pissa raw, zeros are white neos-4295773-pissa decomposed, zeros are white
507 neos-4300652-rahue [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-13 neos-4300652-rahue raw, zeros are black neos-4300652-rahue decomposed, zeros are black neos-4300652-rahue raw, zeros are white neos-4300652-rahue decomposed, zeros are white
508 neos-4306827-ravan [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-30 neos-4306827-ravan raw, zeros are black neos-4306827-ravan decomposed, zeros are black neos-4306827-ravan raw, zeros are white neos-4306827-ravan decomposed, zeros are white
509 neos-4321076-ruwer [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-98 neos-4321076-ruwer raw, zeros are black neos-4321076-ruwer decomposed, zeros are black neos-4321076-ruwer raw, zeros are white neos-4321076-ruwer decomposed, zeros are white
510 neos-4322846-ryton [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-6 neos-4322846-ryton raw, zeros are black neos-4322846-ryton decomposed, zeros are black neos-4322846-ryton raw, zeros are white neos-4322846-ryton decomposed, zeros are white
511 neos-4333464-siret [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-58 neos-4333464-siret raw, zeros are black neos-4333464-siret decomposed, zeros are black neos-4333464-siret raw, zeros are white neos-4333464-siret decomposed, zeros are white
512 neos-4333596-skien [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-43 neos-4333596-skien raw, zeros are black neos-4333596-skien decomposed, zeros are black neos-4333596-skien raw, zeros are white neos-4333596-skien decomposed, zeros are white
513 neos-4335793-snake [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-44 neos-4335793-snake raw, zeros are black neos-4335793-snake decomposed, zeros are black neos-4335793-snake raw, zeros are white neos-4335793-snake decomposed, zeros are white
514 neos-4338804-snowy [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-40 neos-4338804-snowy raw, zeros are black neos-4338804-snowy decomposed, zeros are black neos-4338804-snowy raw, zeros are white neos-4338804-snowy decomposed, zeros are white
515 neos-4343293-stony [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-58 neos-4343293-stony raw, zeros are black neos-4343293-stony decomposed, zeros are black neos-4343293-stony raw, zeros are white neos-4343293-stony decomposed, zeros are white
516 neos-4355351-swalm [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-58 neos-4355351-swalm raw, zeros are black neos-4355351-swalm decomposed, zeros are black neos-4355351-swalm raw, zeros are white neos-4355351-swalm decomposed, zeros are white
517 neos-4358725-tagus [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-57 neos-4358725-tagus raw, zeros are black neos-4358725-tagus decomposed, zeros are black neos-4358725-tagus raw, zeros are white neos-4358725-tagus decomposed, zeros are white
518 neos-4359986-taipa [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-106 neos-4359986-taipa raw, zeros are black neos-4359986-taipa decomposed, zeros are black neos-4359986-taipa raw, zeros are white neos-4359986-taipa decomposed, zeros are white
519 neos-4360552-sangro [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-62 neos-4360552-sangro raw, zeros are black neos-4360552-sangro decomposed, zeros are black neos-4360552-sangro raw, zeros are white neos-4360552-sangro decomposed, zeros are white
520 neos-4382714-ruvuma [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-103 neos-4382714-ruvuma raw, zeros are black neos-4382714-ruvuma decomposed, zeros are black neos-4382714-ruvuma raw, zeros are white neos-4382714-ruvuma decomposed, zeros are white
521 neos-4391920-timok [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-106 neos-4391920-timok raw, zeros are black neos-4391920-timok decomposed, zeros are black neos-4391920-timok raw, zeros are white neos-4391920-timok decomposed, zeros are white
522 neos-4393408-tinui [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-58 neos-4393408-tinui raw, zeros are black neos-4393408-tinui decomposed, zeros are black neos-4393408-tinui raw, zeros are white neos-4393408-tinui decomposed, zeros are white
523 neos-4408804-prosna [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-56 neos-4408804-prosna raw, zeros are black neos-4408804-prosna decomposed, zeros are black neos-4408804-prosna raw, zeros are white neos-4408804-prosna decomposed, zeros are white
524 neos-4409277-trave [MIPLIB] Jeff Linderoth Reported solved by ParaSCIP in 441575 seconds using 71 solvers (72 cores). neos-pseudoapplication-47 neos-4409277-trave raw, zeros are black neos-4409277-trave decomposed, zeros are black neos-4409277-trave raw, zeros are white neos-4409277-trave decomposed, zeros are white
525 neos-4413714-turia [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-67 neos-4413714-turia raw, zeros are black neos-4413714-turia decomposed, zeros are black neos-4413714-turia raw, zeros are white neos-4413714-turia decomposed, zeros are white
526 neos-4477313-unzha [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-110 neos-4477313-unzha raw, zeros are black neos-4477313-unzha decomposed, zeros are black neos-4477313-unzha raw, zeros are white neos-4477313-unzha decomposed, zeros are white
527 neos-4531126-vouga [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-87 neos-4531126-vouga raw, zeros are black neos-4531126-vouga decomposed, zeros are black neos-4531126-vouga raw, zeros are white neos-4531126-vouga decomposed, zeros are white
528 neos-4532248-waihi [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-6 neos-4532248-waihi raw, zeros are black neos-4532248-waihi decomposed, zeros are black neos-4532248-waihi raw, zeros are white neos-4532248-waihi decomposed, zeros are white
529 neos-4533806-waima [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-31 neos-4533806-waima raw, zeros are black neos-4533806-waima decomposed, zeros are black neos-4533806-waima raw, zeros are white neos-4533806-waima decomposed, zeros are white
530 neos-4545615-waita [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-31 neos-4545615-waita raw, zeros are black neos-4545615-waita decomposed, zeros are black neos-4545615-waita raw, zeros are white neos-4545615-waita decomposed, zeros are white
531 neos-4555749-wards [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-31 neos-4555749-wards raw, zeros are black neos-4555749-wards decomposed, zeros are black neos-4555749-wards raw, zeros are white neos-4555749-wards decomposed, zeros are white
532 neos-4562542-watut [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-31 neos-4562542-watut raw, zeros are black neos-4562542-watut decomposed, zeros are black neos-4562542-watut raw, zeros are white neos-4562542-watut decomposed, zeros are white
533 neos-4647027-thurso [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-29 neos-4647027-thurso raw, zeros are black neos-4647027-thurso decomposed, zeros are black neos-4647027-thurso raw, zeros are white neos-4647027-thurso decomposed, zeros are white
534 neos-4647030-tutaki [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-29 neos-4647030-tutaki raw, zeros are black neos-4647030-tutaki decomposed, zeros are black neos-4647030-tutaki raw, zeros are white neos-4647030-tutaki decomposed, zeros are white
535 neos-4647032-veleka [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-29 neos-4647032-veleka raw, zeros are black neos-4647032-veleka decomposed, zeros are black neos-4647032-veleka raw, zeros are white neos-4647032-veleka decomposed, zeros are white
536 neos-4650160-yukon [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-79 neos-4650160-yukon raw, zeros are black neos-4650160-yukon decomposed, zeros are black neos-4650160-yukon raw, zeros are white neos-4650160-yukon decomposed, zeros are white
537 neos-4703857-ahuroa [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-82 neos-4703857-ahuroa raw, zeros are black neos-4703857-ahuroa decomposed, zeros are black neos-4703857-ahuroa raw, zeros are white neos-4703857-ahuroa decomposed, zeros are white
538 neos-4722843-widden [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-30 neos-4722843-widden raw, zeros are black neos-4722843-widden decomposed, zeros are black neos-4722843-widden raw, zeros are white neos-4722843-widden decomposed, zeros are white
539 neos-4724674-aorere [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-30 neos-4724674-aorere raw, zeros are black neos-4724674-aorere decomposed, zeros are black neos-4724674-aorere raw, zeros are white neos-4724674-aorere decomposed, zeros are white
540 neos-4736745-arroux [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-37 neos-4736745-arroux raw, zeros are black neos-4736745-arroux decomposed, zeros are black neos-4736745-arroux raw, zeros are white neos-4736745-arroux decomposed, zeros are white
541 neos-4738912-atrato [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-37 neos-4738912-atrato raw, zeros are black neos-4738912-atrato decomposed, zeros are black neos-4738912-atrato raw, zeros are white neos-4738912-atrato decomposed, zeros are white
542 neos-4754521-awarau [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-51 neos-4754521-awarau raw, zeros are black neos-4754521-awarau decomposed, zeros are black neos-4754521-awarau raw, zeros are white neos-4754521-awarau decomposed, zeros are white
543 neos-4760493-puerua [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-106 neos-4760493-puerua raw, zeros are black neos-4760493-puerua decomposed, zeros are black neos-4760493-puerua raw, zeros are white neos-4760493-puerua decomposed, zeros are white
544 neos-4797081-pakoka [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-51 neos-4797081-pakoka raw, zeros are black neos-4797081-pakoka decomposed, zeros are black neos-4797081-pakoka raw, zeros are white neos-4797081-pakoka decomposed, zeros are white
545 neos-4805882-barwon [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-30 neos-4805882-barwon raw, zeros are black neos-4805882-barwon decomposed, zeros are black neos-4805882-barwon raw, zeros are white neos-4805882-barwon decomposed, zeros are white
546 neos-480878 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-76 neos-480878 raw, zeros are black neos-480878 decomposed, zeros are black neos-480878 raw, zeros are white neos-480878 decomposed, zeros are white
547 neos-4954274-beardy [MIPLIB] Jeff Linderoth Reported solved after 77000 seconds using Gurobi with 32 threads. neos-pseudoapplication-62 neos-4954274-beardy raw, zeros are black neos-4954274-beardy decomposed, zeros are black neos-4954274-beardy raw, zeros are white neos-4954274-beardy decomposed, zeros are white
548 neos-4954340-beaury [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-59 neos-4954340-beaury raw, zeros are black neos-4954340-beaury decomposed, zeros are black neos-4954340-beaury raw, zeros are white neos-4954340-beaury decomposed, zeros are white
549 neos-4954357-bednja [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-59 neos-4954357-bednja raw, zeros are black neos-4954357-bednja decomposed, zeros are black neos-4954357-bednja raw, zeros are white neos-4954357-bednja decomposed, zeros are white
550 neos-4954672-berkel [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-43 neos-4954672-berkel raw, zeros are black neos-4954672-berkel decomposed, zeros are black neos-4954672-berkel raw, zeros are white neos-4954672-berkel decomposed, zeros are white
551 neos-4960896-besbre [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-59 neos-4960896-besbre raw, zeros are black neos-4960896-besbre decomposed, zeros are black neos-4960896-besbre raw, zeros are white neos-4960896-besbre decomposed, zeros are white
552 neos-4966126-blavet [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-59 neos-4966126-blavet raw, zeros are black neos-4966126-blavet decomposed, zeros are black neos-4966126-blavet raw, zeros are white neos-4966126-blavet decomposed, zeros are white
553 neos-4966258-blicks [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-85 neos-4966258-blicks raw, zeros are black neos-4966258-blicks decomposed, zeros are black neos-4966258-blicks raw, zeros are white neos-4966258-blicks decomposed, zeros are white
554 neos-4971100-bodrog [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-20 neos-4971100-bodrog raw, zeros are black neos-4971100-bodrog decomposed, zeros are black neos-4971100-bodrog raw, zeros are white neos-4971100-bodrog decomposed, zeros are white
555 neos-4972437-bojana [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-85 neos-4972437-bojana raw, zeros are black neos-4972437-bojana decomposed, zeros are black neos-4972437-bojana raw, zeros are white neos-4972437-bojana decomposed, zeros are white
556 neos-4972461-bolong [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-85 neos-4972461-bolong raw, zeros are black neos-4972461-bolong decomposed, zeros are black neos-4972461-bolong raw, zeros are white neos-4972461-bolong decomposed, zeros are white
557 neos-4976951-bunnoo [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-85 neos-4976951-bunnoo raw, zeros are black neos-4976951-bunnoo decomposed, zeros are black neos-4976951-bunnoo raw, zeros are white neos-4976951-bunnoo decomposed, zeros are white
558 neos-4984115-canche [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-69 neos-4984115-canche raw, zeros are black neos-4984115-canche decomposed, zeros are black neos-4984115-canche raw, zeros are white neos-4984115-canche decomposed, zeros are white
559 neos-498623 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-5 neos-498623 raw, zeros are black neos-498623 decomposed, zeros are black neos-498623 raw, zeros are white neos-498623 decomposed, zeros are white
560 neos-5013590-toitoi [MIPLIB] Hans Mittelmann additional files should be Gurobi output and solution and submitter neos-pseudoapplication-106 neos-5013590-toitoi raw, zeros are black neos-5013590-toitoi decomposed, zeros are black neos-5013590-toitoi raw, zeros are white neos-5013590-toitoi decomposed, zeros are white
561 neos-5018451-chiese [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-69 neos-5018451-chiese raw, zeros are black neos-5018451-chiese decomposed, zeros are black neos-5018451-chiese raw, zeros are white neos-5018451-chiese decomposed, zeros are white
562 neos-503737 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-47 neos-503737 raw, zeros are black neos-503737 decomposed, zeros are black neos-503737 raw, zeros are white neos-503737 decomposed, zeros are white
563 neos-5041756-cobark [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-12 neos-5041756-cobark raw, zeros are black neos-5041756-cobark decomposed, zeros are black neos-5041756-cobark raw, zeros are white neos-5041756-cobark decomposed, zeros are white
564 neos-5041822-cockle [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-25 neos-5041822-cockle raw, zeros are black neos-5041822-cockle decomposed, zeros are black neos-5041822-cockle raw, zeros are white neos-5041822-cockle decomposed, zeros are white
565 neos-5044663-wairoa [MIPLIB] Hans Mittelmann NEOS submission with known submitter neos-pseudoapplication-53 neos-5044663-wairoa raw, zeros are black neos-5044663-wairoa decomposed, zeros are black neos-5044663-wairoa raw, zeros are white neos-5044663-wairoa decomposed, zeros are white
566 neos-5045105-creuse [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-78 neos-5045105-creuse raw, zeros are black neos-5045105-creuse decomposed, zeros are black neos-5045105-creuse raw, zeros are white neos-5045105-creuse decomposed, zeros are white
567 neos-5049753-cuanza [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-85 neos-5049753-cuanza raw, zeros are black neos-5049753-cuanza decomposed, zeros are black neos-5049753-cuanza raw, zeros are white neos-5049753-cuanza decomposed, zeros are white
568 neos-5051588-culgoa [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-86 neos-5051588-culgoa raw, zeros are black neos-5051588-culgoa decomposed, zeros are black neos-5051588-culgoa raw, zeros are white neos-5051588-culgoa decomposed, zeros are white
569 neos-5052403-cygnet [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-100 neos-5052403-cygnet raw, zeros are black neos-5052403-cygnet decomposed, zeros are black neos-5052403-cygnet raw, zeros are white neos-5052403-cygnet decomposed, zeros are white
570 neos-5075914-elvire [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-35 neos-5075914-elvire raw, zeros are black neos-5075914-elvire decomposed, zeros are black neos-5075914-elvire raw, zeros are white neos-5075914-elvire decomposed, zeros are white
571 neos-5076235-embley [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-17 neos-5076235-embley raw, zeros are black neos-5076235-embley decomposed, zeros are black neos-5076235-embley raw, zeros are white neos-5076235-embley decomposed, zeros are white
572 neos-5078479-escaut [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-35 neos-5078479-escaut raw, zeros are black neos-5078479-escaut decomposed, zeros are black neos-5078479-escaut raw, zeros are white neos-5078479-escaut decomposed, zeros are white
573 neos-5079731-flyers [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-17 neos-5079731-flyers raw, zeros are black neos-5079731-flyers decomposed, zeros are black neos-5079731-flyers raw, zeros are white neos-5079731-flyers decomposed, zeros are white
574 neos-5081619-ganges [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-59 neos-5081619-ganges raw, zeros are black neos-5081619-ganges decomposed, zeros are black neos-5081619-ganges raw, zeros are white neos-5081619-ganges decomposed, zeros are white
575 neos-5083528-gimone [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-67 neos-5083528-gimone raw, zeros are black neos-5083528-gimone decomposed, zeros are black neos-5083528-gimone raw, zeros are white neos-5083528-gimone decomposed, zeros are white
576 neos-5093327-huahum [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-17 neos-5093327-huahum raw, zeros are black neos-5093327-huahum decomposed, zeros are black neos-5093327-huahum raw, zeros are white neos-5093327-huahum decomposed, zeros are white
577 neos-5100895-inster [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-17 neos-5100895-inster raw, zeros are black neos-5100895-inster decomposed, zeros are black neos-5100895-inster raw, zeros are white neos-5100895-inster decomposed, zeros are white
578 neos-5102383-irwell [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-17 neos-5102383-irwell raw, zeros are black neos-5102383-irwell decomposed, zeros are black neos-5102383-irwell raw, zeros are white neos-5102383-irwell decomposed, zeros are white
579 neos-5104907-jarama [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-24 neos-5104907-jarama raw, zeros are black neos-5104907-jarama decomposed, zeros are black neos-5104907-jarama raw, zeros are white neos-5104907-jarama decomposed, zeros are white
580 neos-5106984-jizera [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-24 neos-5106984-jizera raw, zeros are black neos-5106984-jizera decomposed, zeros are black neos-5106984-jizera raw, zeros are white neos-5106984-jizera decomposed, zeros are white
581 neos-5108386-kalang [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-104 neos-5108386-kalang raw, zeros are black neos-5108386-kalang decomposed, zeros are black neos-5108386-kalang raw, zeros are white neos-5108386-kalang decomposed, zeros are white
582 neos-5114902-kasavu [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-104 neos-5114902-kasavu raw, zeros are black neos-5114902-kasavu decomposed, zeros are black neos-5114902-kasavu raw, zeros are white neos-5114902-kasavu decomposed, zeros are white
583 neos-5115478-kaveri [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-54 neos-5115478-kaveri raw, zeros are black neos-5115478-kaveri decomposed, zeros are black neos-5115478-kaveri raw, zeros are white neos-5115478-kaveri decomposed, zeros are white
584 neos-5116085-kenana [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-24 neos-5116085-kenana raw, zeros are black neos-5116085-kenana decomposed, zeros are black neos-5116085-kenana raw, zeros are white neos-5116085-kenana decomposed, zeros are white
585 neos-5118834-korana [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-24 neos-5118834-korana raw, zeros are black neos-5118834-korana decomposed, zeros are black neos-5118834-korana raw, zeros are white neos-5118834-korana decomposed, zeros are white
586 neos-5118851-kowhai [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-104 neos-5118851-kowhai raw, zeros are black neos-5118851-kowhai decomposed, zeros are black neos-5118851-kowhai raw, zeros are white neos-5118851-kowhai decomposed, zeros are white
587 neos-5123665-limmat [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-104 neos-5123665-limmat raw, zeros are black neos-5123665-limmat decomposed, zeros are black neos-5123665-limmat raw, zeros are white neos-5123665-limmat decomposed, zeros are white
588 neos-5125849-lopori [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-42 neos-5125849-lopori raw, zeros are black neos-5125849-lopori decomposed, zeros are black neos-5125849-lopori raw, zeros are white neos-5125849-lopori decomposed, zeros are white
589 neos-5129192-manaia [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-51 neos-5129192-manaia raw, zeros are black neos-5129192-manaia decomposed, zeros are black neos-5129192-manaia raw, zeros are white neos-5129192-manaia decomposed, zeros are white
590 neos-5138690-middle [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-104 neos-5138690-middle raw, zeros are black neos-5138690-middle decomposed, zeros are black neos-5138690-middle raw, zeros are white neos-5138690-middle decomposed, zeros are white
591 neos-5140963-mincio [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-109 neos-5140963-mincio raw, zeros are black neos-5140963-mincio decomposed, zeros are black neos-5140963-mincio raw, zeros are white neos-5140963-mincio decomposed, zeros are white
592 neos-5149806-wieprz [MIPLIB] Hans Mittelmann see ZIMPL model and name on it neos-pseudoapplication-15 neos-5149806-wieprz raw, zeros are black neos-5149806-wieprz decomposed, zeros are black neos-5149806-wieprz raw, zeros are white neos-5149806-wieprz decomposed, zeros are white
593 neos-5151569-mologa [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-82 neos-5151569-mologa raw, zeros are black neos-5151569-mologa decomposed, zeros are black neos-5151569-mologa raw, zeros are white neos-5151569-mologa decomposed, zeros are white
594 neos-5157194-moruya [MIPLIB] Jeff Linderoth Claimed to be infeasible by most solvers. A solution is available that is not feasible in the strict sense. neos-pseudoapplication-41 neos-5157194-moruya raw, zeros are black neos-5157194-moruya decomposed, zeros are black neos-5157194-moruya raw, zeros are white neos-5157194-moruya decomposed, zeros are white
595 neos-5178119-nalagi [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-62 neos-5178119-nalagi raw, zeros are black neos-5178119-nalagi decomposed, zeros are black neos-5178119-nalagi raw, zeros are white neos-5178119-nalagi decomposed, zeros are white
596 neos-5182409-nasivi [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-32 neos-5182409-nasivi raw, zeros are black neos-5182409-nasivi decomposed, zeros are black neos-5182409-nasivi raw, zeros are white neos-5182409-nasivi decomposed, zeros are white
597 neos-5188808-nattai [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-98 neos-5188808-nattai raw, zeros are black neos-5188808-nattai decomposed, zeros are black neos-5188808-nattai raw, zeros are white neos-5188808-nattai decomposed, zeros are white
598 neos-5189128-totara [MIPLIB] Hans Mittelmann distribution of fruit neos-pseudoapplication-101 neos-5189128-totara raw, zeros are black neos-5189128-totara decomposed, zeros are black neos-5189128-totara raw, zeros are white neos-5189128-totara decomposed, zeros are white
599 neos-5192052-neckar [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-74 neos-5192052-neckar raw, zeros are black neos-5192052-neckar decomposed, zeros are black neos-5192052-neckar raw, zeros are white neos-5192052-neckar decomposed, zeros are white
600 neos-5193246-nerang [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-32 neos-5193246-nerang raw, zeros are black neos-5193246-nerang decomposed, zeros are black neos-5193246-nerang raw, zeros are white neos-5193246-nerang decomposed, zeros are white
601 neos-5196530-nuhaka [MIPLIB] Jeff Linderoth (None provided) neos-pseudoapplication-32 neos-5196530-nuhaka raw, zeros are black neos-5196530-nuhaka decomposed, zeros are black neos-5196530-nuhaka raw, zeros are white neos-5196530-nuhaka decomposed, zeros are white
602 neos-520729 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-50 neos-520729 raw, zeros are black neos-520729 decomposed, zeros are black neos-520729 raw, zeros are white neos-520729 decomposed, zeros are white
603 neos-5221106-oparau [MIPLIB] Hans Mittelmann Seem to be VRP output from 2-hour runs of Gurobi on 12 threads is included neos-pseudoapplication-46 neos-5221106-oparau raw, zeros are black neos-5221106-oparau decomposed, zeros are black neos-5221106-oparau raw, zeros are white neos-5221106-oparau decomposed, zeros are white
604 neos-5223573-tarwin [MIPLIB] Hans Mittelmann check model neos-pseudoapplication-19 neos-5223573-tarwin raw, zeros are black neos-5223573-tarwin decomposed, zeros are black neos-5223573-tarwin raw, zeros are white neos-5223573-tarwin decomposed, zeros are white
605 neos-5251015-ogosta [MIPLIB] Hans Mittelmann similar to instance ns5223573 submitted in January Solved with ParaSCIP in 525353 seconds with 71 solvers(72 cores). neos-pseudoapplication-19 neos-5251015-ogosta raw, zeros are black neos-5251015-ogosta decomposed, zeros are black neos-5251015-ogosta raw, zeros are white neos-5251015-ogosta decomposed, zeros are white
606 neos-525149 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-110 neos-525149 raw, zeros are black neos-525149 decomposed, zeros are black neos-525149 raw, zeros are white neos-525149 decomposed, zeros are white
607 neos-5260764-orauea [MIPLIB] Hans Mittelmann Seem to be VRP output from 2-hour runs of Gurobi on 12 threads is included neos-pseudoapplication-102 neos-5260764-orauea raw, zeros are black neos-5260764-orauea decomposed, zeros are black neos-5260764-orauea raw, zeros are white neos-5260764-orauea decomposed, zeros are white
608 neos-5261882-treska [MIPLIB] Hans Mittelmann Seem to be VRP output from 2-hour runs of Gurobi on 12 threads is included neos-pseudoapplication-102 neos-5261882-treska raw, zeros are black neos-5261882-treska decomposed, zeros are black neos-5261882-treska raw, zeros are white neos-5261882-treska decomposed, zeros are white
609 neos-5266653-tugela [MIPLIB] Hans Mittelmann Seem to be VRP output from 2-hour runs of Gurobi on 12 threads is included neos-pseudoapplication-102 neos-5266653-tugela raw, zeros are black neos-5266653-tugela decomposed, zeros are black neos-5266653-tugela raw, zeros are white neos-5266653-tugela decomposed, zeros are white
610 neos-5273874-yomtsa [MIPLIB] Hans Mittelmann similar to ns5223573 submitted in January neos-pseudoapplication-19 neos-5273874-yomtsa raw, zeros are black neos-5273874-yomtsa decomposed, zeros are black neos-5273874-yomtsa raw, zeros are white neos-5273874-yomtsa decomposed, zeros are white
611 neos-555001 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-94 neos-555001 raw, zeros are black neos-555001 decomposed, zeros are black neos-555001 raw, zeros are white neos-555001 decomposed, zeros are white
612 neos-555343 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-15 neos-555343 raw, zeros are black neos-555343 decomposed, zeros are black neos-555343 raw, zeros are white neos-555343 decomposed, zeros are white
613 neos-555424 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-15 neos-555424 raw, zeros are black neos-555424 decomposed, zeros are black neos-555424 raw, zeros are white neos-555424 decomposed, zeros are white
614 neos-555884 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-32 neos-555884 raw, zeros are black neos-555884 decomposed, zeros are black neos-555884 raw, zeros are white neos-555884 decomposed, zeros are white
615 neos-565672 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-82 neos-565672 raw, zeros are black neos-565672 decomposed, zeros are black neos-565672 raw, zeros are white neos-565672 decomposed, zeros are white
616 neos-574665 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-78 neos-574665 raw, zeros are black neos-574665 decomposed, zeros are black neos-574665 raw, zeros are white neos-574665 decomposed, zeros are white
617 neos-578379 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-42 neos-578379 raw, zeros are black neos-578379 decomposed, zeros are black neos-578379 raw, zeros are white neos-578379 decomposed, zeros are white
618 neos-585192 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-92 neos-585192 raw, zeros are black neos-585192 decomposed, zeros are black neos-585192 raw, zeros are white neos-585192 decomposed, zeros are white
619 neos-585467 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-92 neos-585467 raw, zeros are black neos-585467 decomposed, zeros are black neos-585467 raw, zeros are white neos-585467 decomposed, zeros are white
620 neos-595904 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-43 neos-595904 raw, zeros are black neos-595904 decomposed, zeros are black neos-595904 raw, zeros are white neos-595904 decomposed, zeros are white
621 neos-619167 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-83 neos-619167 raw, zeros are black neos-619167 decomposed, zeros are black neos-619167 raw, zeros are white neos-619167 decomposed, zeros are white
622 neos-631517 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-70 neos-631517 raw, zeros are black neos-631517 decomposed, zeros are black neos-631517 raw, zeros are white neos-631517 decomposed, zeros are white
623 neos-631710 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application. Solved with Gurobi 4.6.1 (12 threads) in 1264.7 sec. neos-pseudoapplication-75 neos-631710 raw, zeros are black neos-631710 decomposed, zeros are black neos-631710 raw, zeros are white neos-631710 decomposed, zeros are white
624 neos-633273 [MIPLIB] NEOS Server Submission Collection of anonymous submissions to the NEOS Server for Optimization neos-pseudoapplication-10 neos-633273 raw, zeros are black neos-633273 decomposed, zeros are black neos-633273 raw, zeros are white neos-633273 decomposed, zeros are white
625 neos-662469 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-73 neos-662469 raw, zeros are black neos-662469 decomposed, zeros are black neos-662469 raw, zeros are white neos-662469 decomposed, zeros are white
626 neos-686190 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-60 neos-686190 raw, zeros are black neos-686190 decomposed, zeros are black neos-686190 raw, zeros are white neos-686190 decomposed, zeros are white
627 neos-691058 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-110 neos-691058 raw, zeros are black neos-691058 decomposed, zeros are black neos-691058 raw, zeros are white neos-691058 decomposed, zeros are white
628 neos-738098 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-15 neos-738098 raw, zeros are black neos-738098 decomposed, zeros are black neos-738098 raw, zeros are white neos-738098 decomposed, zeros are white
629 neos-780889 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-94 neos-780889 raw, zeros are black neos-780889 decomposed, zeros are black neos-780889 raw, zeros are white neos-780889 decomposed, zeros are white
630 neos-787933 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-36 neos-787933 raw, zeros are black neos-787933 decomposed, zeros are black neos-787933 raw, zeros are white neos-787933 decomposed, zeros are white
631 neos-799711 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-25 neos-799711 raw, zeros are black neos-799711 decomposed, zeros are black neos-799711 raw, zeros are white neos-799711 decomposed, zeros are white
632 neos-799716 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-1 neos-799716 raw, zeros are black neos-799716 decomposed, zeros are black neos-799716 raw, zeros are white neos-799716 decomposed, zeros are white
633 neos-807639 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-79 neos-807639 raw, zeros are black neos-807639 decomposed, zeros are black neos-807639 raw, zeros are white neos-807639 decomposed, zeros are white
634 neos-820879 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-23 neos-820879 raw, zeros are black neos-820879 decomposed, zeros are black neos-820879 raw, zeros are white neos-820879 decomposed, zeros are white
635 neos-824661 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-93 neos-824661 raw, zeros are black neos-824661 decomposed, zeros are black neos-824661 raw, zeros are white neos-824661 decomposed, zeros are white
636 neos-826224 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-87 neos-826224 raw, zeros are black neos-826224 decomposed, zeros are black neos-826224 raw, zeros are white neos-826224 decomposed, zeros are white
637 neos-826650 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-87 neos-826650 raw, zeros are black neos-826650 decomposed, zeros are black neos-826650 raw, zeros are white neos-826650 decomposed, zeros are white
638 neos-827015 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-95 neos-827015 raw, zeros are black neos-827015 decomposed, zeros are black neos-827015 raw, zeros are white neos-827015 decomposed, zeros are white
639 neos-827175 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-87 neos-827175 raw, zeros are black neos-827175 decomposed, zeros are black neos-827175 raw, zeros are white neos-827175 decomposed, zeros are white
640 neos-829552 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-95 neos-829552 raw, zeros are black neos-829552 decomposed, zeros are black neos-829552 raw, zeros are white neos-829552 decomposed, zeros are white
641 neos-831188 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-94 neos-831188 raw, zeros are black neos-831188 decomposed, zeros are black neos-831188 raw, zeros are white neos-831188 decomposed, zeros are white
642 neos-848198 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-3 neos-848198 raw, zeros are black neos-848198 decomposed, zeros are black neos-848198 raw, zeros are white neos-848198 decomposed, zeros are white
643 neos-848589 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-77 neos-848589 raw, zeros are black neos-848589 decomposed, zeros are black neos-848589 raw, zeros are white neos-848589 decomposed, zeros are white
644 neos-850681 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-12 neos-850681 raw, zeros are black neos-850681 decomposed, zeros are black neos-850681 raw, zeros are white neos-850681 decomposed, zeros are white
645 neos-859770 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-81 neos-859770 raw, zeros are black neos-859770 decomposed, zeros are black neos-859770 raw, zeros are white neos-859770 decomposed, zeros are white
646 neos-860300 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-23 neos-860300 raw, zeros are black neos-860300 decomposed, zeros are black neos-860300 raw, zeros are white neos-860300 decomposed, zeros are white
647 neos-872648 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-61 neos-872648 raw, zeros are black neos-872648 decomposed, zeros are black neos-872648 raw, zeros are white neos-872648 decomposed, zeros are white
648 neos-873061 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-61 neos-873061 raw, zeros are black neos-873061 decomposed, zeros are black neos-873061 raw, zeros are white neos-873061 decomposed, zeros are white
649 neos-876808 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-62 neos-876808 raw, zeros are black neos-876808 decomposed, zeros are black neos-876808 raw, zeros are white neos-876808 decomposed, zeros are white
650 neos-885086 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-8 neos-885086 raw, zeros are black neos-885086 decomposed, zeros are black neos-885086 raw, zeros are white neos-885086 decomposed, zeros are white
651 neos-885524 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-100 neos-885524 raw, zeros are black neos-885524 decomposed, zeros are black neos-885524 raw, zeros are white neos-885524 decomposed, zeros are white
652 neos-911970 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-70 neos-911970 raw, zeros are black neos-911970 decomposed, zeros are black neos-911970 raw, zeros are white neos-911970 decomposed, zeros are white
653 neos-913984 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-2 neos-913984 raw, zeros are black neos-913984 decomposed, zeros are black neos-913984 raw, zeros are white neos-913984 decomposed, zeros are white
654 neos-914441 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-75 neos-914441 raw, zeros are black neos-914441 decomposed, zeros are black neos-914441 raw, zeros are white neos-914441 decomposed, zeros are white
655 neos-932721 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-56 neos-932721 raw, zeros are black neos-932721 decomposed, zeros are black neos-932721 raw, zeros are white neos-932721 decomposed, zeros are white
656 neos-933562 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-94 neos-933562 raw, zeros are black neos-933562 decomposed, zeros are black neos-933562 raw, zeros are white neos-933562 decomposed, zeros are white
657 neos-933638 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-34 neos-933638 raw, zeros are black neos-933638 decomposed, zeros are black neos-933638 raw, zeros are white neos-933638 decomposed, zeros are white
658 neos-933966 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-34 neos-933966 raw, zeros are black neos-933966 decomposed, zeros are black neos-933966 raw, zeros are white neos-933966 decomposed, zeros are white
659 neos-935234 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-34 neos-935234 raw, zeros are black neos-935234 decomposed, zeros are black neos-935234 raw, zeros are white neos-935234 decomposed, zeros are white
660 neos-935769 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-34 neos-935769 raw, zeros are black neos-935769 decomposed, zeros are black neos-935769 raw, zeros are white neos-935769 decomposed, zeros are white
661 neos-941313 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-81 neos-941313 raw, zeros are black neos-941313 decomposed, zeros are black neos-941313 raw, zeros are white neos-941313 decomposed, zeros are white
662 neos-948346 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-48 neos-948346 raw, zeros are black neos-948346 decomposed, zeros are black neos-948346 raw, zeros are white neos-948346 decomposed, zeros are white
663 neos-950242 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-72 neos-950242 raw, zeros are black neos-950242 decomposed, zeros are black neos-950242 raw, zeros are white neos-950242 decomposed, zeros are white
664 neos-952987 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-22 neos-952987 raw, zeros are black neos-952987 decomposed, zeros are black neos-952987 raw, zeros are white neos-952987 decomposed, zeros are white
665 neos-953928 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-13 neos-953928 raw, zeros are black neos-953928 decomposed, zeros are black neos-953928 raw, zeros are white neos-953928 decomposed, zeros are white
666 neos-954925 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-48 neos-954925 raw, zeros are black neos-954925 decomposed, zeros are black neos-954925 raw, zeros are white neos-954925 decomposed, zeros are white
667 neos-956971 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-48 neos-956971 raw, zeros are black neos-956971 decomposed, zeros are black neos-956971 raw, zeros are white neos-956971 decomposed, zeros are white
668 neos-957143 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-48 neos-957143 raw, zeros are black neos-957143 decomposed, zeros are black neos-957143 raw, zeros are white neos-957143 decomposed, zeros are white
669 neos-957323 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-48 neos-957323 raw, zeros are black neos-957323 decomposed, zeros are black neos-957323 raw, zeros are white neos-957323 decomposed, zeros are white
670 neos-960392 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-94 neos-960392 raw, zeros are black neos-960392 decomposed, zeros are black neos-960392 raw, zeros are white neos-960392 decomposed, zeros are white
671 neos-983171 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-34 neos-983171 raw, zeros are black neos-983171 decomposed, zeros are black neos-983171 raw, zeros are white neos-983171 decomposed, zeros are white
672 neos16 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-90 neos16 raw, zeros are black neos16 decomposed, zeros are black neos16 raw, zeros are white neos16 decomposed, zeros are white
673 neos17 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-66 neos17 raw, zeros are black neos17 decomposed, zeros are black neos17 raw, zeros are white neos17 decomposed, zeros are white
674 neos18 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-49 neos18 raw, zeros are black neos18 decomposed, zeros are black neos18 raw, zeros are white neos18 decomposed, zeros are white
675 neos2 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-93 neos2 raw, zeros are black neos2 decomposed, zeros are black neos2 raw, zeros are white neos2 decomposed, zeros are white
676 neos22 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-27 neos22 raw, zeros are black neos22 decomposed, zeros are black neos22 raw, zeros are white neos22 decomposed, zeros are white
677 neos4 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-65 neos4 raw, zeros are black neos4 decomposed, zeros are black neos4 raw, zeros are white neos4 decomposed, zeros are white
678 neos5 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-21 neos5 raw, zeros are black neos5 decomposed, zeros are black neos5 raw, zeros are white neos5 decomposed, zeros are white
679 neos6 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-47 neos6 raw, zeros are black neos6 decomposed, zeros are black neos6 raw, zeros are white neos6 decomposed, zeros are white
680 neos8 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-15 neos8 raw, zeros are black neos8 decomposed, zeros are black neos8 raw, zeros are white neos8 decomposed, zeros are white
681 neos859080 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-96 neos859080 raw, zeros are black neos859080 decomposed, zeros are black neos859080 raw, zeros are white neos859080 decomposed, zeros are white
682 neos9 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-5 neos9 raw, zeros are black neos9 decomposed, zeros are black neos9 raw, zeros are white neos9 decomposed, zeros are white
683 net12 [MIPLIB] P. Belotti Network design instance - net12 raw, zeros are black net12 decomposed, zeros are black net12 raw, zeros are white net12 decomposed, zeros are white
684 netdiversion [MIPLIB] Chris Cullenbine Directed network diversion problem - netdiversion raw, zeros are black netdiversion decomposed, zeros are black netdiversion raw, zeros are white netdiversion decomposed, zeros are white
685 newdano [MIPLIB] Daniel Bienstock Telecommunications applications dano newdano raw, zeros are black newdano decomposed, zeros are black newdano raw, zeros are white newdano decomposed, zeros are white
686 nexp-150-20-1-5 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. exp_and_fc nexp-150-20-1-5 raw, zeros are black nexp-150-20-1-5 decomposed, zeros are black nexp-150-20-1-5 raw, zeros are white nexp-150-20-1-5 decomposed, zeros are white
687 nexp-150-20-8-5 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. exp_and_fc nexp-150-20-8-5 raw, zeros are black nexp-150-20-8-5 decomposed, zeros are black nexp-150-20-8-5 raw, zeros are white nexp-150-20-8-5 decomposed, zeros are white
688 nexp-50-20-1-1 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. exp_and_fc nexp-50-20-1-1 raw, zeros are black nexp-50-20-1-1 decomposed, zeros are black nexp-50-20-1-1 raw, zeros are white nexp-50-20-1-1 decomposed, zeros are white
689 nexp-50-20-4-2 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. exp_and_fc nexp-50-20-4-2 raw, zeros are black nexp-50-20-4-2 decomposed, zeros are black nexp-50-20-4-2 raw, zeros are white nexp-50-20-4-2 decomposed, zeros are white
690 nh97_potential [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - nh97_potential raw, zeros are black nh97_potential decomposed, zeros are black nh97_potential raw, zeros are white nh97_potential decomposed, zeros are white
691 nh97_tension [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - nh97_tension raw, zeros are black nh97_tension decomposed, zeros are black nh97_tension raw, zeros are white nh97_tension decomposed, zeros are white
692 nj1 [MIPLIB] Jonathan Eckstein Electoral district design with various levels of symmetry breaking constraints. nj nj1 raw, zeros are black nj1 decomposed, zeros are black nj1 raw, zeros are white nj1 decomposed, zeros are white
693 nj2 [MIPLIB] Jonathan Eckstein Electoral district design with various levels of symmetry breaking constraints. nj nj2 raw, zeros are black nj2 decomposed, zeros are black nj2 raw, zeros are white nj2 decomposed, zeros are white
694 nj3 [MIPLIB] Jonathan Eckstein Electoral district design with various levels of symmetry breaking constraints. nj nj3 raw, zeros are black nj3 decomposed, zeros are black nj3 raw, zeros are white nj3 decomposed, zeros are white
695 no-ip-64999 [MIPLIB] Christopher Hojny integer programming formulation that verifies that no integer programming formulation of a given 0/1-point set exists noip no-ip-64999 raw, zeros are black no-ip-64999 decomposed, zeros are black no-ip-64999 raw, zeros are white no-ip-64999 decomposed, zeros are white
696 noswot [MIPLIB] J. Gregory, L. Schrage Unknown application - noswot raw, zeros are black noswot decomposed, zeros are black noswot raw, zeros are white noswot decomposed, zeros are white
697 npmv07 [MIPLIB] Q. Chen Unknown application - npmv07 raw, zeros are black npmv07 decomposed, zeros are black npmv07 raw, zeros are white npmv07 decomposed, zeros are white
698 ns1111636 [MIPLIB] NEOS Server Submission Network routing problem. Solved in June 2013 by CPLEX 12.5.1 with 32 threads in about 102 hours. neos-pseudoapplication-67 ns1111636 raw, zeros are black ns1111636 decomposed, zeros are black ns1111636 raw, zeros are white ns1111636 decomposed, zeros are white
699 ns1116954 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-51 ns1116954 raw, zeros are black ns1116954 decomposed, zeros are black ns1116954 raw, zeros are white ns1116954 decomposed, zeros are white
700 ns1208400 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-108 ns1208400 raw, zeros are black ns1208400 decomposed, zeros are black ns1208400 raw, zeros are white ns1208400 decomposed, zeros are white
701 ns1430538 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application. neos-pseudoapplication-76 ns1430538 raw, zeros are black ns1430538 decomposed, zeros are black ns1430538 raw, zeros are white ns1430538 decomposed, zeros are white
702 ns1456591 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-52 ns1456591 raw, zeros are black ns1456591 decomposed, zeros are black ns1456591 raw, zeros are white ns1456591 decomposed, zeros are white
703 ns1631475 [MIPLIB] NEOS Server Submission Traveling salesman problem model neos-pseudoapplication-75 ns1631475 raw, zeros are black ns1631475 decomposed, zeros are black ns1631475 raw, zeros are white ns1631475 decomposed, zeros are white
704 ns1644855 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application. Solved with Gurobi 4.5.1 on a 12-core Linux system in 1431.15 sec. neos-pseudoapplication-76 ns1644855 raw, zeros are black ns1644855 decomposed, zeros are black ns1644855 raw, zeros are white ns1644855 decomposed, zeros are white
705 ns1679495 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application. neos-pseudoapplication-9 ns1679495 raw, zeros are black ns1679495 decomposed, zeros are black ns1679495 raw, zeros are white ns1679495 decomposed, zeros are white
706 ns1760995 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application. neos-pseudoapplication-12 ns1760995 raw, zeros are black ns1760995 decomposed, zeros are black ns1760995 raw, zeros are white ns1760995 decomposed, zeros are white
707 ns1828997 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application. neos-pseudoapplication-13 ns1828997 raw, zeros are black ns1828997 decomposed, zeros are black ns1828997 raw, zeros are white ns1828997 decomposed, zeros are white
708 ns1830653 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-110 ns1830653 raw, zeros are black ns1830653 decomposed, zeros are black ns1830653 raw, zeros are white ns1830653 decomposed, zeros are white
709 ns1849932 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application. neos-pseudoapplication-60 ns1849932 raw, zeros are black ns1849932 decomposed, zeros are black ns1849932 raw, zeros are white ns1849932 decomposed, zeros are white
710 ns1856153 [MIPLIB] NEOS Server Submission Sensor placement problem neos-pseudoapplication-6 ns1856153 raw, zeros are black ns1856153 decomposed, zeros are black ns1856153 raw, zeros are white ns1856153 decomposed, zeros are white
711 ns1904248 [MIPLIB] NEOS Server Submission Sensor placement problem neos-pseudoapplication-6 ns1904248 raw, zeros are black ns1904248 decomposed, zeros are black ns1904248 raw, zeros are white ns1904248 decomposed, zeros are white
712 ns1905797 [MIPLIB] NEOS Server Submission Vehicle routing problem neos-pseudoapplication-102 ns1905797 raw, zeros are black ns1905797 decomposed, zeros are black ns1905797 raw, zeros are white ns1905797 decomposed, zeros are white
713 ns1952667 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-78 ns1952667 raw, zeros are black ns1952667 decomposed, zeros are black ns1952667 raw, zeros are white ns1952667 decomposed, zeros are white
714 ns2034125 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-67 ns2034125 raw, zeros are black ns2034125 decomposed, zeros are black ns2034125 raw, zeros are white ns2034125 decomposed, zeros are white
715 ns2071214 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. neos-pseudoapplication-46 ns2071214 raw, zeros are black ns2071214 decomposed, zeros are black ns2071214 raw, zeros are white ns2071214 decomposed, zeros are white
716 ns2122698 [MIPLIB] Timo Berthold Instance coming from the NEOS Server with unknown application. Solved by SCIP-CPLEX in 9500 seconds. neos-pseudoapplication-93 ns2122698 raw, zeros are black ns2122698 decomposed, zeros are black ns2122698 raw, zeros are white ns2122698 decomposed, zeros are white
717 ns2124243 [MIPLIB] Timo Berthold Instance coming from the NEOS Server with unknown application neos-pseudoapplication-93 ns2124243 raw, zeros are black ns2124243 decomposed, zeros are black ns2124243 raw, zeros are white ns2124243 decomposed, zeros are white
718 ns4-pr6 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. nus-prxy ns4-pr6 raw, zeros are black ns4-pr6 decomposed, zeros are black ns4-pr6 raw, zeros are white ns4-pr6 decomposed, zeros are white
719 ns930473 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application neos-pseudoapplication-46 ns930473 raw, zeros are black ns930473 decomposed, zeros are black ns930473 raw, zeros are white ns930473 decomposed, zeros are white
720 nsa [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - nsa raw, zeros are black nsa decomposed, zeros are black nsa raw, zeros are white nsa decomposed, zeros are white
721 nsr8k [MIPLIB] MIPLIB submission pool Crew scheduling instance - nsr8k raw, zeros are black nsr8k decomposed, zeros are black nsr8k raw, zeros are white nsr8k decomposed, zeros are white
722 nsrand-ipx [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - nsrand-ipx raw, zeros are black nsrand-ipx decomposed, zeros are black nsrand-ipx raw, zeros are white nsrand-ipx decomposed, zeros are white
723 nu120-pr12 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. nus-prxy nu120-pr12 raw, zeros are black nu120-pr12 decomposed, zeros are black nu120-pr12 raw, zeros are white nu120-pr12 decomposed, zeros are white
724 nu4-pr9 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. nus-prxy nu4-pr9 raw, zeros are black nu4-pr9 decomposed, zeros are black nu4-pr9 raw, zeros are white nu4-pr9 decomposed, zeros are white
725 nursesched-medium-hint03 [MIPLIB] Haroldo Gambini Santos Nurse Scheduling Problems from the First International Nurse Rostering Competition - INRC 2010 nursescheduling nursesched-medium-hint03 raw, zeros are black nursesched-medium-hint03 decomposed, zeros are black nursesched-medium-hint03 raw, zeros are white nursesched-medium-hint03 decomposed, zeros are white
726 nursesched-medium04 [MIPLIB] Haroldo Gambini Santos Nurse Scheduling Problems from the First International Nurse Rostering Competition - INRC 2010 nursescheduling nursesched-medium04 raw, zeros are black nursesched-medium04 decomposed, zeros are black nursesched-medium04 raw, zeros are white nursesched-medium04 decomposed, zeros are white
727 nursesched-sprint-hidden09 [MIPLIB] Haroldo Gambini Santos Nurse Scheduling Problems from the First International Nurse Rostering Competition - INRC 2010 nursescheduling nursesched-sprint-hidden09 raw, zeros are black nursesched-sprint-hidden09 decomposed, zeros are black nursesched-sprint-hidden09 raw, zeros are white nursesched-sprint-hidden09 decomposed, zeros are white
728 nursesched-sprint-late03 [MIPLIB] Haroldo Gambini Santos Nurse Scheduling Problems from the First International Nurse Rostering Competition - INRC 2010 nursescheduling nursesched-sprint-late03 raw, zeros are black nursesched-sprint-late03 decomposed, zeros are black nursesched-sprint-late03 raw, zeros are white nursesched-sprint-late03 decomposed, zeros are white
729 nursesched-sprint02 [MIPLIB] Haroldo Gambini Santos Nurse Scheduling Problems from the First International Nurse Rostering Competition - INRC 2010 nursescheduling nursesched-sprint02 raw, zeros are black nursesched-sprint02 decomposed, zeros are black nursesched-sprint02 raw, zeros are white nursesched-sprint02 decomposed, zeros are white
730 nw04 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - nw04 raw, zeros are black nw04 decomposed, zeros are black nw04 raw, zeros are white nw04 decomposed, zeros are white
731 ofi [MIPLIB] Luigi Poderico Natural gas supply portfolio optimization - ofi raw, zeros are black ofi decomposed, zeros are black ofi raw, zeros are white ofi decomposed, zeros are white
732 ofi2 [MIPLIB] Luigi Poderico Imported from the MIPLIB2010 submissions. - ofi2 raw, zeros are black ofi2 decomposed, zeros are black ofi2 raw, zeros are white ofi2 decomposed, zeros are white
733 oocsp-racks030e6cci [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 oocsp-racks oocsp-racks030e6cci raw, zeros are black oocsp-racks030e6cci decomposed, zeros are black oocsp-racks030e6cci raw, zeros are white oocsp-racks030e6cci decomposed, zeros are white
734 oocsp-racks030f7cci [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 oocsp-racks oocsp-racks030f7cci raw, zeros are black oocsp-racks030f7cci decomposed, zeros are black oocsp-racks030f7cci raw, zeros are white oocsp-racks030f7cci decomposed, zeros are white
735 opm2-z10-s4 [MIPLIB] Daniel Espinoza Problems coming from precedence constrained knapsacks arising in mining applications. These are one-period problems with integer data but large root LP GAP opm2 opm2-z10-s4 raw, zeros are black opm2-z10-s4 decomposed, zeros are black opm2-z10-s4 raw, zeros are white opm2-z10-s4 decomposed, zeros are white
736 opm2-z12-s8 [MIPLIB] Daniel Espinoza Problems coming from precedence constrained knapsacks arising in mining applications. These are one-period problems with integer data but large root LP GAP opm2 opm2-z12-s8 raw, zeros are black opm2-z12-s8 decomposed, zeros are black opm2-z12-s8 raw, zeros are white opm2-z12-s8 decomposed, zeros are white
737 opm2-z6-s1 [MIPLIB] Daniel Espinoza Problems coming from precedence constrained knapsacks arising in mining applications. These are one-period problems with integer data but large root LP GAP opm2 opm2-z6-s1 raw, zeros are black opm2-z6-s1 decomposed, zeros are black opm2-z6-s1 raw, zeros are white opm2-z6-s1 decomposed, zeros are white
738 opm2-z7-s8 [MIPLIB] Daniel Espinoza Problems coming from precedence constrained knapsacks arising in mining applications. These are one-period problems with integer data but large root LP GAP opm2 opm2-z7-s8 raw, zeros are black opm2-z7-s8 decomposed, zeros are black opm2-z7-s8 raw, zeros are white opm2-z7-s8 decomposed, zeros are white
739 opm2-z8-s0 [MIPLIB] Daniel Espinoza Problems coming from precedence constrained knapsacks arising in mining applications. These are one-period problems with integer data but large root LP GAP opm2 opm2-z8-s0 raw, zeros are black opm2-z8-s0 decomposed, zeros are black opm2-z8-s0 raw, zeros are white opm2-z8-s0 decomposed, zeros are white
740 opt1217 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - opt1217 raw, zeros are black opt1217 decomposed, zeros are black opt1217 raw, zeros are white opt1217 decomposed, zeros are white
741 osorio-cta [MIPLIB] Jordi Castro Set of MILP instances of the CTA (Controlled Tabular Adjustment) problem, a method to protect statistical tabular data, belonging to the field of SDC (Statistical Disclosure Control). Raw data of instances are real or pseudo-real, provided by several National Statistical Agencies. We generated the CTA problem for these data. cta osorio-cta raw, zeros are black osorio-cta decomposed, zeros are black osorio-cta raw, zeros are white osorio-cta decomposed, zeros are white
742 p0201 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. pfour p0201 raw, zeros are black p0201 decomposed, zeros are black p0201 raw, zeros are white p0201 decomposed, zeros are white
743 p200x1188c [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. pr_product p200x1188c raw, zeros are black p200x1188c decomposed, zeros are black p200x1188c raw, zeros are white p200x1188c decomposed, zeros are white
744 p2m2p1m1p0n100 [MIPLIB] B. Krishnamoorthy, G. Pataki A 0-1 knapsack problem constructed to be difficult - p2m2p1m1p0n100 raw, zeros are black p2m2p1m1p0n100 decomposed, zeros are black p2m2p1m1p0n100 raw, zeros are white p2m2p1m1p0n100 decomposed, zeros are white
745 p500x2988 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. pr_product p500x2988 raw, zeros are black p500x2988 decomposed, zeros are black p500x2988 raw, zeros are white p500x2988 decomposed, zeros are white
746 p500x2988d [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. pr_product p500x2988d raw, zeros are black p500x2988d decomposed, zeros are black p500x2988d raw, zeros are white p500x2988d decomposed, zeros are white
747 pb-fit2d [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 pb- pb-fit2d raw, zeros are black pb-fit2d decomposed, zeros are black pb-fit2d raw, zeros are white pb-fit2d decomposed, zeros are white
748 pb-gfrd-pnc [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 pb- pb-gfrd-pnc raw, zeros are black pb-gfrd-pnc decomposed, zeros are black pb-gfrd-pnc raw, zeros are white pb-gfrd-pnc decomposed, zeros are white
749 pb-grow22 [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 pb- pb-grow22 raw, zeros are black pb-grow22 decomposed, zeros are black pb-grow22 raw, zeros are white pb-grow22 decomposed, zeros are white
750 pb-market-split8-70-4 [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 pb- pb-market-split8-70-4 raw, zeros are black pb-market-split8-70-4 decomposed, zeros are black pb-market-split8-70-4 raw, zeros are white pb-market-split8-70-4 decomposed, zeros are white
751 peg-solitaire-a3 [MIPLIB] Hiroshige Dan Model to solve instance of a board game "Peg solitaire" pegsolitaire peg-solitaire-a3 raw, zeros are black peg-solitaire-a3 decomposed, zeros are black peg-solitaire-a3 raw, zeros are white peg-solitaire-a3 decomposed, zeros are white
752 pg [MIPLIB] M. Dawande Multiproduct partial shipment model - pg raw, zeros are black pg decomposed, zeros are black pg raw, zeros are white pg decomposed, zeros are white
753 pg5_34 [MIPLIB] M. Dawande Multiproduct partial shipment model - pg5_34 raw, zeros are black pg5_34 decomposed, zeros are black pg5_34 raw, zeros are white pg5_34 decomposed, zeros are white
754 physiciansched3-3 [MIPLIB] Pelin Damci-Kurt Physician scheduling problem for hospitalist, radiology and kidney specialist groups. physiciansched physiciansched3-3 raw, zeros are black physiciansched3-3 decomposed, zeros are black physiciansched3-3 raw, zeros are white physiciansched3-3 decomposed, zeros are white
755 physiciansched3-4 [MIPLIB] Pelin Damci-Kurt Physician scheduling problem for hospitalist, radiology and kidney specialist groups. physiciansched physiciansched3-4 raw, zeros are black physiciansched3-4 decomposed, zeros are black physiciansched3-4 raw, zeros are white physiciansched3-4 decomposed, zeros are white
756 physiciansched5-3 [MIPLIB] Pelin Damci-Kurt Physician scheduling problem for hospitalist, radiology and kidney specialist groups. physiciansched physiciansched5-3 raw, zeros are black physiciansched5-3 decomposed, zeros are black physiciansched5-3 raw, zeros are white physiciansched5-3 decomposed, zeros are white
757 physiciansched6-1 [MIPLIB] Pelin Damci-Kurt Physician scheduling problem for hospitalist, radiology and kidney specialist groups. physiciansched physiciansched6-1 raw, zeros are black physiciansched6-1 decomposed, zeros are black physiciansched6-1 raw, zeros are white physiciansched6-1 decomposed, zeros are white
758 physiciansched6-2 [MIPLIB] Pelin Damci-Kurt Physician scheduling problem for hospitalist, radiology and kidney specialist groups. physiciansched physiciansched6-2 raw, zeros are black physiciansched6-2 decomposed, zeros are black physiciansched6-2 raw, zeros are white physiciansched6-2 decomposed, zeros are white
759 pigeon-08 [MIPLIB] Sam Allen Instance of 3D packing (container loading) problem pigeon pigeon-08 raw, zeros are black pigeon-08 decomposed, zeros are black pigeon-08 raw, zeros are white pigeon-08 decomposed, zeros are white
760 pigeon-10 [MIPLIB] Sam Allen Instance of 3D packing (container loading) problem pigeon pigeon-10 raw, zeros are black pigeon-10 decomposed, zeros are black pigeon-10 raw, zeros are white pigeon-10 decomposed, zeros are white
761 pigeon-13 [MIPLIB] Sam Allen Instance of 3D packing (container loading) problem. The problem was solved by the Gurobi Optimizer version 5.0.1. It took approximately 22 hours. pigeon pigeon-13 raw, zeros are black pigeon-13 decomposed, zeros are black pigeon-13 raw, zeros are white pigeon-13 decomposed, zeros are white
762 pigeon-16 [MIPLIB] Sam Allen Instance of 3D packing (container loading) problem pigeon pigeon-16 raw, zeros are black pigeon-16 decomposed, zeros are black pigeon-16 raw, zeros are white pigeon-16 decomposed, zeros are white
763 pigeon-20 [MIPLIB] Sam Allen Instance of 3D packing (container loading) problem pigeon pigeon-20 raw, zeros are black pigeon-20 decomposed, zeros are black pigeon-20 raw, zeros are white pigeon-20 decomposed, zeros are white
764 piperout-03 [MIPLIB] Gleb Belov Pipe routing with flexibility constraints. Instances with _GCM in the name are simple routing piperout piperout-03 raw, zeros are black piperout-03 decomposed, zeros are black piperout-03 raw, zeros are white piperout-03 decomposed, zeros are white
765 piperout-08 [MIPLIB] Gleb Belov Pipe routing with flexibility constraints. Instances with _GCM in the name are simple routing piperout piperout-08 raw, zeros are black piperout-08 decomposed, zeros are black piperout-08 raw, zeros are white piperout-08 decomposed, zeros are white
766 piperout-27 [MIPLIB] Gleb Belov Pipe routing with flexibility constraints. Instances with _GCM in the name are simple routing piperout piperout-27 raw, zeros are black piperout-27 decomposed, zeros are black piperout-27 raw, zeros are white piperout-27 decomposed, zeros are white
767 piperout-d20 [MIPLIB] Gleb Belov Pipe routing with flexibility constraints. Instances with _GCM in the name are simple routing piperout piperout-d20 raw, zeros are black piperout-d20 decomposed, zeros are black piperout-d20 raw, zeros are white piperout-d20 decomposed, zeros are white
768 piperout-d27 [MIPLIB] Gleb Belov Pipe routing with flexibility constraints. Instances with _GCM in the name are simple routing piperout piperout-d27 raw, zeros are black piperout-d27 decomposed, zeros are black piperout-d27 raw, zeros are white piperout-d27 decomposed, zeros are white
769 pizza27i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 pizza pizza27i raw, zeros are black pizza27i decomposed, zeros are black pizza27i raw, zeros are white pizza27i decomposed, zeros are white
770 pizza78i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 pizza pizza78i raw, zeros are black pizza78i decomposed, zeros are black pizza78i raw, zeros are white pizza78i decomposed, zeros are white
771 pk1 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - pk1 raw, zeros are black pk1 decomposed, zeros are black pk1 raw, zeros are white pk1 decomposed, zeros are white
772 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. polygonpack polygonpack4-10 raw, zeros are black polygonpack4-10 decomposed, zeros are black polygonpack4-10 raw, zeros are white polygonpack4-10 decomposed, zeros are white
773 polygonpack4-15 [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. polygonpack polygonpack4-15 raw, zeros are black polygonpack4-15 decomposed, zeros are black polygonpack4-15 raw, zeros are white polygonpack4-15 decomposed, zeros are white
774 polygonpack4-7 [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. polygonpack polygonpack4-7 raw, zeros are black polygonpack4-7 decomposed, zeros are black polygonpack4-7 raw, zeros are white polygonpack4-7 decomposed, zeros are white
775 polygonpack5-15 [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. polygonpack polygonpack5-15 raw, zeros are black polygonpack5-15 decomposed, zeros are black polygonpack5-15 raw, zeros are white polygonpack5-15 decomposed, zeros are white
776 ponderthis0517-inf [MIPLIB] Rob Pratt Infeasible version of IBM Ponder This problem (with 52 characters and no spaces) from May 2017: https://www.research.ibm.com/haifa/ponderthis/challenges/May2017.html - ponderthis0517-inf raw, zeros are black ponderthis0517-inf decomposed, zeros are black ponderthis0517-inf raw, zeros are white ponderthis0517-inf decomposed, zeros are white
777 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. - probportfolio raw, zeros are black probportfolio decomposed, zeros are black probportfolio raw, zeros are white probportfolio decomposed, zeros are white
778 prod1 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - prod1 raw, zeros are black prod1 decomposed, zeros are black prod1 raw, zeros are white prod1 decomposed, zeros are white
779 prod2 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - prod2 raw, zeros are black prod2 decomposed, zeros are black prod2 raw, zeros are white prod2 decomposed, zeros are white
780 proteindesign121hz512p19 [MIPLIB] Gleb Belov Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 proteindesign proteindesign121hz512p19 raw, zeros are black proteindesign121hz512p19 decomposed, zeros are black proteindesign121hz512p19 raw, zeros are white proteindesign121hz512p19 decomposed, zeros are white
781 proteindesign121hz512p9 [MIPLIB] Gleb Belov Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 proteindesign proteindesign121hz512p9 raw, zeros are black proteindesign121hz512p9 decomposed, zeros are black proteindesign121hz512p9 raw, zeros are white proteindesign121hz512p9 decomposed, zeros are white
782 proteindesign121pgb11p9 [MIPLIB] Gleb Belov Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 proteindesign proteindesign121pgb11p9 raw, zeros are black proteindesign121pgb11p9 decomposed, zeros are black proteindesign121pgb11p9 raw, zeros are white proteindesign121pgb11p9 decomposed, zeros are white
783 proteindesign122trx11p8 [MIPLIB] Gleb Belov Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 proteindesign proteindesign122trx11p8 raw, zeros are black proteindesign122trx11p8 decomposed, zeros are black proteindesign122trx11p8 raw, zeros are white proteindesign122trx11p8 decomposed, zeros are white
784 pw-myciel4 [MIPLIB] Arie Koster Model to compute the pathwidth of Mycielski-4 instance from DIMACS graph coloring database - pw-myciel4 raw, zeros are black pw-myciel4 decomposed, zeros are black pw-myciel4 raw, zeros are white pw-myciel4 decomposed, zeros are white
785 pythago7824 [MIPLIB] Felix J. L. Willamowski 2-coloring of Pythagorean triples - pythago7824 raw, zeros are black pythago7824 decomposed, zeros are black pythago7824 raw, zeros are white pythago7824 decomposed, zeros are white
786 pythago7825 [MIPLIB] Felix J. L. Willamowski 2-coloring of Pythagorean triples - pythago7825 raw, zeros are black pythago7825 decomposed, zeros are black pythago7825 raw, zeros are white pythago7825 decomposed, zeros are white
787 qap10 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - qap10 raw, zeros are black qap10 decomposed, zeros are black qap10 raw, zeros are white qap10 decomposed, zeros are white
788 qiu [MIPLIB] Y. Chiu, J. Eckstein Fiber-optic network design, logical SONET ring level - qiu raw, zeros are black qiu decomposed, zeros are black qiu raw, zeros are white qiu decomposed, zeros are white
789 qnet1 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - qnet1 raw, zeros are black qnet1 decomposed, zeros are black qnet1 raw, zeros are white qnet1 decomposed, zeros are white
790 qnet1_o [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - qnet1_o raw, zeros are black qnet1_o decomposed, zeros are black qnet1_o raw, zeros are white qnet1_o decomposed, zeros are white
791 queens-30 [MIPLIB] Ashutosh Mahajan Models the problem of placing as many queens on a 30 by 30 chess board as possible so that each queen threatens at most one other queen. - queens-30 raw, zeros are black queens-30 decomposed, zeros are black queens-30 raw, zeros are white queens-30 decomposed, zeros are white
792 r4l4-02-tree-bounds-50 [MIPLIB] Christian Liebchen Periodic Event Scheduling Problem (PESP) Model for Timetable Optimization in Public Transport Data originating from (see additional file) https://lintim.math.uni-goettingen.de/ and http://num.math.uni-goettingen.de/~m.goerigk/pesplib/ Notation of the variables in the MIP model according to Sec. 9 in Liebchen (2006) - r4l4-02-tree-bounds-50 raw, zeros are black r4l4-02-tree-bounds-50 decomposed, zeros are black r4l4-02-tree-bounds-50 raw, zeros are white r4l4-02-tree-bounds-50 decomposed, zeros are white
793 r50x360 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. pr_product r50x360 raw, zeros are black r50x360 decomposed, zeros are black r50x360 raw, zeros are white r50x360 decomposed, zeros are white
794 radiationm18-12-05 [MIPLIB] Gleb Belov Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 radiation radiationm18-12-05 raw, zeros are black radiationm18-12-05 decomposed, zeros are black radiationm18-12-05 raw, zeros are white radiationm18-12-05 decomposed, zeros are white
795 radiationm40-10-02 [MIPLIB] Gleb Belov Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 radiation radiationm40-10-02 raw, zeros are black radiationm40-10-02 decomposed, zeros are black radiationm40-10-02 raw, zeros are white radiationm40-10-02 decomposed, zeros are white
796 rail01 [MIPLIB] Thomas Schlechte Track allocation problem modeled as arc coupling problem rail0 rail01 raw, zeros are black rail01 decomposed, zeros are black rail01 raw, zeros are white rail01 decomposed, zeros are white
797 rail02 [MIPLIB] Thomas Schlechte Track allocation problem modeled as arc coupling problem rail0 rail02 raw, zeros are black rail02 decomposed, zeros are black rail02 raw, zeros are white rail02 decomposed, zeros are white
798 rail03 [MIPLIB] Thomas Schlechte Track allocation problem modeled as arc coupling problem The problem was solved by CPLEX 12.4. It took approximately 170 hours. rail0 rail03 raw, zeros are black rail03 decomposed, zeros are black rail03 raw, zeros are white rail03 decomposed, zeros are white
799 rail507 [MIPLIB] A. Caprara, M. Fischetti, P. Toth Railway crew scheduling - rail507 raw, zeros are black rail507 decomposed, zeros are black rail507 raw, zeros are white rail507 decomposed, zeros are white
800 railway_8_1_0 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - railway_8_1_0 raw, zeros are black railway_8_1_0 decomposed, zeros are black railway_8_1_0 raw, zeros are white railway_8_1_0 decomposed, zeros are white
801 ramos3 [MIPLIB] F. Ramos Set covering problem from a product manufacturing application - ramos3 raw, zeros are black ramos3 decomposed, zeros are black ramos3 raw, zeros are white ramos3 decomposed, zeros are white
802 ran12x21 [MIPLIB] J. Aronson Fixed charge transportation problem ran ran12x21 raw, zeros are black ran12x21 decomposed, zeros are black ran12x21 raw, zeros are white ran12x21 decomposed, zeros are white
803 ran13x13 [MIPLIB] J. Aronson Fixed charge transportation problem ran ran13x13 raw, zeros are black ran13x13 decomposed, zeros are black ran13x13 raw, zeros are white ran13x13 decomposed, zeros are white
804 ran14x18-disj-8 [MIPLIB] J. Aronson Fixed charge transportation problem ran ran14x18-disj-8 raw, zeros are black ran14x18-disj-8 decomposed, zeros are black ran14x18-disj-8 raw, zeros are white ran14x18-disj-8 decomposed, zeros are white
805 rd-rplusc-21 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - rd-rplusc-21 raw, zeros are black rd-rplusc-21 decomposed, zeros are black rd-rplusc-21 raw, zeros are white rd-rplusc-21 decomposed, zeros are white
806 reblock115 [MIPLIB] Andreas Bley Multi-period mine production scheduling instances reblock reblock115 raw, zeros are black reblock115 decomposed, zeros are black reblock115 raw, zeros are white reblock115 decomposed, zeros are white
807 reblock166 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance reblock reblock166 raw, zeros are black reblock166 decomposed, zeros are black reblock166 raw, zeros are white reblock166 decomposed, zeros are white
808 reblock354 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance. Solved using ug[SCIP/spx], a distributed massively parallel version of SCIP run on 2,000 cores at the HLRN-II super computer facility. reblock reblock354 raw, zeros are black reblock354 decomposed, zeros are black reblock354 raw, zeros are white reblock354 decomposed, zeros are white
809 reblock420 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance reblock reblock420 raw, zeros are black reblock420 decomposed, zeros are black reblock420 raw, zeros are white reblock420 decomposed, zeros are white
810 rentacar [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - rentacar raw, zeros are black rentacar decomposed, zeros are black rentacar raw, zeros are white rentacar decomposed, zeros are white
811 rlp1 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - rlp1 raw, zeros are black rlp1 decomposed, zeros are black rlp1 raw, zeros are white rlp1 decomposed, zeros are white
812 rmatr100-p10 [MIPLIB] Dmitry Krushinsky Instance coming from a formulation of the p-Median problem using square cost matrices rmatr rmatr100-p10 raw, zeros are black rmatr100-p10 decomposed, zeros are black rmatr100-p10 raw, zeros are white rmatr100-p10 decomposed, zeros are white
813 rmatr100-p5 [MIPLIB] Dmitry Krushinsky Instance coming from a formulation of the p-Median problem using square cost matrices rmatr rmatr100-p5 raw, zeros are black rmatr100-p5 decomposed, zeros are black rmatr100-p5 raw, zeros are white rmatr100-p5 decomposed, zeros are white
814 rmatr200-p10 [MIPLIB] Dmitry Krushinsky Instance coming from a formulation of the p-Median problem using square cost matrices. Solved by Gurobi 4.6.1 (12 threads) in 19644 seconds (January 2012). rmatr rmatr200-p10 raw, zeros are black rmatr200-p10 decomposed, zeros are black rmatr200-p10 raw, zeros are white rmatr200-p10 decomposed, zeros are white
815 rmatr200-p20 [MIPLIB] Dmitry Krushinsky Instance coming from a formulation of the p-Median problem using square cost matrices. Solved using ug[SCIP/spx], a distributed massively parallel version of SCIP run on 2,000 cores at the HLRN-II super computer facility. rmatr rmatr200-p20 raw, zeros are black rmatr200-p20 decomposed, zeros are black rmatr200-p20 raw, zeros are white rmatr200-p20 decomposed, zeros are white
816 rmatr200-p5 [MIPLIB] Dmitry Krushinsky Instance coming from a formulation of the p-Median problem using square cost matrices rmatr rmatr200-p5 raw, zeros are black rmatr200-p5 decomposed, zeros are black rmatr200-p5 raw, zeros are white rmatr200-p5 decomposed, zeros are white
817 rmine11 [MIPLIB] Daniel Espinoza Set of instances comming from open pit minning over a cube and several time periods and two knapsack constraints per period rmine rmine11 raw, zeros are black rmine11 decomposed, zeros are black rmine11 raw, zeros are white rmine11 decomposed, zeros are white
818 rmine13 [MIPLIB] Daniel Espinoza Set of instances comming from open pit minning over a cube and several time periods and two knapsack constraints per period rmine rmine13 raw, zeros are black rmine13 decomposed, zeros are black rmine13 raw, zeros are white rmine13 decomposed, zeros are white
819 rmine15 [MIPLIB] Daniel Espinoza Set of instances comming from open pit minning over a cube and several time periods and two knapsack constraints per period rmine rmine15 raw, zeros are black rmine15 decomposed, zeros are black rmine15 raw, zeros are white rmine15 decomposed, zeros are white
820 rmine21 [MIPLIB] Daniel Espinoza Instance coming from open pit mining over a cube considering multiple time periods and two knapsack constraints per period rmine rmine21 raw, zeros are black rmine21 decomposed, zeros are black rmine21 raw, zeros are white rmine21 decomposed, zeros are white
821 rocI-3-11 [MIPLIB] Joerg Rambau Optimal control model in the deterministic dynamic system given by bounded-confidence dynamics in a system of opinions rocI rocI-3-11 raw, zeros are black rocI-3-11 decomposed, zeros are black rocI-3-11 raw, zeros are white rocI-3-11 decomposed, zeros are white
822 rocI-4-11 [MIPLIB] Joerg Rambau Optimal control model in the deterministic dynamic system given by bounded-confidence dynamics in a system of opinions rocI rocI-4-11 raw, zeros are black rocI-4-11 decomposed, zeros are black rocI-4-11 raw, zeros are white rocI-4-11 decomposed, zeros are white
823 rocII-10-11 [MIPLIB] Joerg Rambau Optimal control model in the deterministic dynamic system given by bounded-confidence dynamics in a system of opinions rocI rocII-10-11 raw, zeros are black rocII-10-11 decomposed, zeros are black rocII-10-11 raw, zeros are white rocII-10-11 decomposed, zeros are white
824 rocII-5-11 [MIPLIB] Joerg Rambau Optimal control model in the deterministic dynamic system given by bounded-confidence dynamics in a system of opinions rocI rocII-5-11 raw, zeros are black rocII-5-11 decomposed, zeros are black rocII-5-11 raw, zeros are white rocII-5-11 decomposed, zeros are white
825 rocII-8-11 [MIPLIB] Joerg Rambau Optimal control model in the deterministic dynamic system given by bounded-confidence dynamics in a system of opinions rocI rocII-8-11 raw, zeros are black rocII-8-11 decomposed, zeros are black rocII-8-11 raw, zeros are white rocII-8-11 decomposed, zeros are white
826 rococoB10-011000 [MIPLIB] A. Chabrier, E. Danna, C. Le Pape, L. Perron Model for dimensioning the arc capacities in a telecommunication network rococo rococoB10-011000 raw, zeros are black rococoB10-011000 decomposed, zeros are black rococoB10-011000 raw, zeros are white rococoB10-011000 decomposed, zeros are white
827 rococoC10-001000 [MIPLIB] A. Chabrier, E. Danna, C. Le Pape, L. Perron Model for dimensioning the arc capacities in a telecommunication network rococo rococoC10-001000 raw, zeros are black rococoC10-001000 decomposed, zeros are black rococoC10-001000 raw, zeros are white rococoC10-001000 decomposed, zeros are white
828 rococoC11-010100 [MIPLIB] A. Chabrier, E. Danna, C. Le Pape, L. Perron Model for dimensioning the arc capacities in a telecommunication network. rococo rococoC11-010100 raw, zeros are black rococoC11-010100 decomposed, zeros are black rococoC11-010100 raw, zeros are white rococoC11-010100 decomposed, zeros are white
829 rococoC11-011100 [MIPLIB] A. Chabrier, E. Danna, C. Le Pape, L. Perron Model for dimensioning the arc capacities in a telecommunication network. Solved by Gurobi 4.5.1 (4 threads) in 66892.47 seconds. rococo rococoC11-011100 raw, zeros are black rococoC11-011100 decomposed, zeros are black rococoC11-011100 raw, zeros are white rococoC11-011100 decomposed, zeros are white
830 rococoC12-010001 [MIPLIB] A. Chabrier, E. Danna, C. Le Pape, L. Perron Model for dimensioning the arc capacities in a telecommunication network. rococo rococoC12-010001 raw, zeros are black rococoC12-010001 decomposed, zeros are black rococoC12-010001 raw, zeros are white rococoC12-010001 decomposed, zeros are white
831 roi2alpha3n4 [MIPLIB] Domenico Salvagnin Neurobiology application: optimal placing of sensors on the scalp to maximize signal on a given ROI, also taking uniformity of coverage into account. - roi2alpha3n4 raw, zeros are black roi2alpha3n4 decomposed, zeros are black roi2alpha3n4 raw, zeros are white roi2alpha3n4 decomposed, zeros are white
832 roi5alpha10n8 [MIPLIB] Domenico Salvagnin Neurobiology application: optimal placing of sensors on the scalp to maximize signal on a given ROI, also taking uniformity of coverage into account. - roi5alpha10n8 raw, zeros are black roi5alpha10n8 decomposed, zeros are black roi5alpha10n8 raw, zeros are white roi5alpha10n8 decomposed, zeros are white
833 roll3000 [MIPLIB] L. Kroon Rolling stock and line planning instance - roll3000 raw, zeros are black roll3000 decomposed, zeros are black roll3000 raw, zeros are white roll3000 decomposed, zeros are white
834 rout [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - rout raw, zeros are black rout decomposed, zeros are black rout raw, zeros are white rout decomposed, zeros are white
835 rpp22falsei [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 rpp rpp22falsei raw, zeros are black rpp22falsei decomposed, zeros are black rpp22falsei raw, zeros are white rpp22falsei decomposed, zeros are white
836 rvb-sub [MIPLIB] S. Weider Set partitioning instance resulting from a column generation algorithm used for duty scheduling in public transportation - rvb-sub raw, zeros are black rvb-sub decomposed, zeros are black rvb-sub raw, zeros are white rvb-sub decomposed, zeros are white
837 rwth-timetable [MIPLIB] Gerald Lach University Course Timetabling from the RWTH Aachen - rwth-timetable raw, zeros are black rwth-timetable decomposed, zeros are black rwth-timetable raw, zeros are white rwth-timetable decomposed, zeros are white
838 s100 [MIPLIB] Daniel Espinoza Wine Scheduling problem with 100 jobs and four processing machines Spinoza s100 raw, zeros are black s100 decomposed, zeros are black s100 raw, zeros are white s100 decomposed, zeros are white
839 s1234 [MIPLIB] Siwei Sun These models come from my cryptographic research and are used to search for the best differential characteristics of the round-reduced versions of the block cipher Serpent with the mixed-integer programming technique. For all the models, including S1234.lp, S56701.lp, S456701.lp, I have found a feasible solution in the corresponding mst file. The challenge is that can we find better solutions or can we find the best solutions. SiweiSun s1234 raw, zeros are black s1234 decomposed, zeros are black s1234 raw, zeros are white s1234 decomposed, zeros are white
840 s250r10 [MIPLIB] Daniel Espinoza Wine Scheduling problem with 250 jobs (up to 10 alternatives for processing) and four processing machines Spinoza s250r10 raw, zeros are black s250r10 decomposed, zeros are black s250r10 raw, zeros are white s250r10 decomposed, zeros are white
841 s55 [MIPLIB] Daniel Espinoza Wine Scheduling problem with 55 jobs and four processing machines Spinoza s55 raw, zeros are black s55 decomposed, zeros are black s55 raw, zeros are white s55 decomposed, zeros are white
842 s82 [MIPLIB] Daniel Espinoza Wine Scheduling problem with 82 jobs and four processing machines Spinoza s82 raw, zeros are black s82 decomposed, zeros are black s82 raw, zeros are white s82 decomposed, zeros are white
843 satellites2-25 [MIPLIB] He Renjie Ihe attachment is some instances generated from real life satelliteschedule problem data,these instances 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 instances. satellites satellites2-25 raw, zeros are black satellites2-25 decomposed, zeros are black satellites2-25 raw, zeros are white satellites2-25 decomposed, zeros are white
844 satellites2-60-fs [MIPLIB] He Renjie Satellite scheduling instance satellites satellites2-60-fs raw, zeros are black satellites2-60-fs decomposed, zeros are black satellites2-60-fs raw, zeros are white satellites2-60-fs decomposed, zeros are white
845 satellites3-25 [MIPLIB] He Renjie Ihe attachment is some instances generated from real life satelliteschedule problem data,these instances 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 instances. satellites satellites3-25 raw, zeros are black satellites3-25 decomposed, zeros are black satellites3-25 raw, zeros are white satellites3-25 decomposed, zeros are white
846 satellites4-25 [MIPLIB] He Renjie Ihe attachment is some instances generated from real life satelliteschedule problem data,these instances 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 instances. satellites satellites4-25 raw, zeros are black satellites4-25 decomposed, zeros are black satellites4-25 raw, zeros are white satellites4-25 decomposed, zeros are white
847 savsched1 [MIPLIB] Gerardo Gonzalez Imported from the MIPLIB2010 submissions. - savsched1 raw, zeros are black savsched1 decomposed, zeros are black savsched1 raw, zeros are white savsched1 decomposed, zeros are white
848 scpj4scip [MIPLIB] Shunji Umetani This is a random test instance 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 instances. We have also generated reduced instances 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 instance generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark scp scpj4scip raw, zeros are black scpj4scip decomposed, zeros are black scpj4scip raw, zeros are white scpj4scip decomposed, zeros are white
849 scpk4 [MIPLIB] Shunji Umetani This is a random test instance 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 instances. We have also generated reduced instances 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 instance generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark scp scpk4 raw, zeros are black scpk4 decomposed, zeros are black scpk4 raw, zeros are white scpk4 decomposed, zeros are white
850 scpl4 [MIPLIB] Shunji Umetani This is a random test instance 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 instances. We have also generated reduced instances 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 instance generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark scp scpl4 raw, zeros are black scpl4 decomposed, zeros are black scpl4 raw, zeros are white scpl4 decomposed, zeros are white
851 scpm1 [MIPLIB] Shunji Umetani This is a random test instance 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 instances. We have also generated reduced instances 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 instance generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark scp scpm1 raw, zeros are black scpm1 decomposed, zeros are black scpm1 raw, zeros are white scpm1 decomposed, zeros are white
852 sct1 [MIPLIB] Siemens Assembly line balancing for printed circuit board production sct sct1 raw, zeros are black sct1 decomposed, zeros are black sct1 raw, zeros are white sct1 decomposed, zeros are white
853 sct2 [MIPLIB] Siemens Assembly line balancing for printed circuit board production sct sct2 raw, zeros are black sct2 decomposed, zeros are black sct2 raw, zeros are white sct2 decomposed, zeros are white
854 sct31 [MIPLIB] Siemens Assembly line balancing for printed circuit board production sct sct31 raw, zeros are black sct31 decomposed, zeros are black sct31 raw, zeros are white sct31 decomposed, zeros are white
855 sct32 [MIPLIB] Siemens Assembly line balancing for printed circuit board production. First solved by Gurobi 7.0 in 65 hours (32 threads). sct sct32 raw, zeros are black sct32 decomposed, zeros are black sct32 raw, zeros are white sct32 decomposed, zeros are white
856 sct5 [MIPLIB] Siemens Assembly line balancing for printed circuit board production sct sct5 raw, zeros are black sct5 decomposed, zeros are black sct5 raw, zeros are white sct5 decomposed, zeros are white
857 seqsolve1 [MIPLIB] Irv Lustig The 3 problems in this group (seqsolve1-seqsolve3) represent a hierarchical optimization process, which is derived from a customer problem for assigning people to sites into blocks of time on days of the week. The specialty of this submission is that the best known solution for seqsolveX can be used as a MIP start for seqsolveX+1. For a description of the connections between the problems, please refer to the README.txt contained in the model data for this submission, which also includes MIP start files and a Gurobi log file. seqsolve seqsolve1 raw, zeros are black seqsolve1 decomposed, zeros are black seqsolve1 raw, zeros are white seqsolve1 decomposed, zeros are white
858 seqsolve2short4288 [MIPLIB] Irv Lustig The 3 problems in this group (seqsolve1-seqsolve3) represent a hierarchical optimization process, which is derived from a customer problem for assigning people to sites into blocks of time on days of the week. The specialty of this submission is that the best known solution for seqsolveX can be used as a MIP start for seqsolveX+1. For a description of the connections between the problems, please refer to the README.txt contained in the model data for this submission, which also includes MIP start files and a Gurobi log file. seqsolve seqsolve2short4288 raw, zeros are black seqsolve2short4288 decomposed, zeros are black seqsolve2short4288 raw, zeros are white seqsolve2short4288 decomposed, zeros are white
859 seqsolve3short4288excess384 [MIPLIB] Irv Lustig The 3 problems in this group (seqsolve1-seqsolve3) represent a hierarchical optimization process, which is derived from a customer problem for assigning people to sites into blocks of time on days of the week. The specialty of this submission is that the best known solution for seqsolveX can be used as a MIP start for seqsolveX+1. For a description of the connections between the problems, please refer to the README.txt contained in the model data for this submission, which also includes MIP start files and a Gurobi log file. seqsolve seqsolve3short4288excess384 raw, zeros are black seqsolve3short4288excess384 decomposed, zeros are black seqsolve3short4288excess384 raw, zeros are white seqsolve3short4288excess384 decomposed, zeros are white
860 set3-20 [MIPLIB] 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). set3 set3-20 raw, zeros are black set3-20 decomposed, zeros are black set3-20 raw, zeros are white set3-20 decomposed, zeros are white
861 seymour [MIPLIB] W. Cook, P. Seymour A set-covering problem that arose from work related to the proof of the 4-color theorem. - seymour raw, zeros are black seymour decomposed, zeros are black seymour raw, zeros are white seymour decomposed, zeros are white
862 seymour1 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - seymour1 raw, zeros are black seymour1 decomposed, zeros are black seymour1 raw, zeros are white seymour1 decomposed, zeros are white
863 shiftreg1-4 [MIPLIB] Domenico Salvagnin Multi-activity shift scheduling problem with 1 activity and 12 employees, using an implicit model based on a regular language. shiftreg shiftreg1-4 raw, zeros are black shiftreg1-4 decomposed, zeros are black shiftreg1-4 raw, zeros are white shiftreg1-4 decomposed, zeros are white
864 shiftreg2-7 [MIPLIB] Domenico Salvagnin Multi-activity shift scheduling problem with 2 activities and 12 employees, using an implicit model based on a regular language. shiftreg shiftreg2-7 raw, zeros are black shiftreg2-7 decomposed, zeros are black shiftreg2-7 raw, zeros are white shiftreg2-7 decomposed, zeros are white
865 shiftreg5-1 [MIPLIB] Domenico Salvagnin Multi-activity shift scheduling problem with 5 activities and 24 employees, using an implicit model based on a regular language. shiftreg shiftreg5-1 raw, zeros are black shiftreg5-1 decomposed, zeros are black shiftreg5-1 raw, zeros are white shiftreg5-1 decomposed, zeros are white
866 shipsched [MIPLIB] Marco Luebbecke A ship scheduling problem on the Kiel Canal - shipsched raw, zeros are black shipsched decomposed, zeros are black shipsched raw, zeros are white shipsched decomposed, zeros are white
867 shipschedule3shipsi [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 shipschedule shipschedule3shipsi raw, zeros are black shipschedule3shipsi decomposed, zeros are black shipschedule3shipsi raw, zeros are white shipschedule3shipsi decomposed, zeros are white
868 shipschedule6shipsmixi [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 shipschedule shipschedule6shipsmixi raw, zeros are black shipschedule6shipsmixi decomposed, zeros are black shipschedule6shipsmixi raw, zeros are white shipschedule6shipsmixi decomposed, zeros are white
869 shipschedule8shipsmixuci [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 shipschedule shipschedule8shipsmixuci raw, zeros are black shipschedule8shipsmixuci decomposed, zeros are black shipschedule8shipsmixuci raw, zeros are white shipschedule8shipsmixuci decomposed, zeros are white
870 shs1014 [MIPLIB] Christoph Helmberg Joint online truck scheduling and inventory management for multiple warehouses. shs shs1014 raw, zeros are black shs1014 decomposed, zeros are black shs1014 raw, zeros are white shs1014 decomposed, zeros are white
871 shs1023 [MIPLIB] C. Helmberg Joint online truck scheduling and inventory management for multiple warehouses. The problem was solved by CPLEX 12.5 on a Intel Xeon E7540 @ 2.00 GHz, 1TB with 24 cores and 24 threads. The maximum memory requirements were 410GB. It took approximately 114.5 hours. shs shs1023 raw, zeros are black shs1023 decomposed, zeros are black shs1023 raw, zeros are white shs1023 decomposed, zeros are white
872 shs1042 [MIPLIB] C. Helmberg Joint online truck scheduling and inventory management for multiple warehouses. shs shs1042 raw, zeros are black shs1042 decomposed, zeros are black shs1042 raw, zeros are white shs1042 decomposed, zeros are white
873 siena1 [MIPLIB] Double-Click SAS Crew scheduling instance - siena1 raw, zeros are black siena1 decomposed, zeros are black siena1 raw, zeros are white siena1 decomposed, zeros are white
874 sing11 [MIPLIB] Daniel Espinoza Imported from the MIPLIB2010 submissions. sing sing11 raw, zeros are black sing11 decomposed, zeros are black sing11 raw, zeros are white sing11 decomposed, zeros are white
875 sing17 [MIPLIB] Daniel Espinoza Imported from the MIPLIB2010 submissions. sing sing17 raw, zeros are black sing17 decomposed, zeros are black sing17 raw, zeros are white sing17 decomposed, zeros are white
876 sing326 [MIPLIB] Daniel Espinoza Imported from the MIPLIB2010 submissions. sing sing326 raw, zeros are black sing326 decomposed, zeros are black sing326 raw, zeros are white sing326 decomposed, zeros are white
877 sing44 [MIPLIB] Daniel Espinoza Imported from the MIPLIB2010 submissions. sing sing44 raw, zeros are black sing44 decomposed, zeros are black sing44 raw, zeros are white sing44 decomposed, zeros are white
878 sing5 [MIPLIB] Daniel Espinoza Imported from the MIPLIB2010 submissions. sing sing5 raw, zeros are black sing5 decomposed, zeros are black sing5 raw, zeros are white sing5 decomposed, zeros are white
879 snip10x10-35r1budget17 [MIPLIB] Utz-Uwe Haus Exact MILP reformulation using binary decision diagrams to obtain scenario bundles of 2-stage stochastic expected shortest path and expected maximum flow problem with decision dependent scenario probabilities. Notes: * very few binary variables * for each fixing of the binaries a system of equations computing conditioned probabilities remains - snip10x10-35r1budget17 raw, zeros are black snip10x10-35r1budget17 decomposed, zeros are black snip10x10-35r1budget17 raw, zeros are white snip10x10-35r1budget17 decomposed, zeros are white
880 snp-02-004-104 [MIPLIB] Gerald Gamrath Supply network planning problems. supplynetworkplanning snp-02-004-104 raw, zeros are black snp-02-004-104 decomposed, zeros are black snp-02-004-104 raw, zeros are white snp-02-004-104 decomposed, zeros are white
881 snp-04-052-052 [MIPLIB] Gerald Gamrath Supply network planning problems. supplynetworkplanning snp-04-052-052 raw, zeros are black snp-04-052-052 decomposed, zeros are black snp-04-052-052 raw, zeros are white snp-04-052-052 decomposed, zeros are white
882 snp-06-004-052 [MIPLIB] Gerald Gamrath Supply network planning problems. supplynetworkplanning snp-06-004-052 raw, zeros are black snp-06-004-052 decomposed, zeros are black snp-06-004-052 raw, zeros are white snp-06-004-052 decomposed, zeros are white
883 snp-10-004-052 [MIPLIB] Gerald Gamrath Supply network planning problems. supplynetworkplanning snp-10-004-052 raw, zeros are black snp-10-004-052 decomposed, zeros are black snp-10-004-052 raw, zeros are white snp-10-004-052 decomposed, zeros are white
884 snp-10-052-052 [MIPLIB] Gerald Gamrath Supply network planning problems. supplynetworkplanning snp-10-052-052 raw, zeros are black snp-10-052-052 decomposed, zeros are black snp-10-052-052 raw, zeros are white snp-10-052-052 decomposed, zeros are white
885 sorrell3 [MIPLIB] Toni Sorrell These instances are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. independentset sorrell3 raw, zeros are black sorrell3 decomposed, zeros are black sorrell3 raw, zeros are white sorrell3 decomposed, zeros are white
886 sorrell4 [MIPLIB] Toni Sorrell These instances are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. independentset sorrell4 raw, zeros are black sorrell4 decomposed, zeros are black sorrell4 raw, zeros are white sorrell4 decomposed, zeros are white
887 sorrell7 [MIPLIB] Toni Sorrell These instances are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. independentset sorrell7 raw, zeros are black sorrell7 decomposed, zeros are black sorrell7 raw, zeros are white sorrell7 decomposed, zeros are white
888 sorrell8 [MIPLIB] Toni Sorrell These instances are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. independentset sorrell8 raw, zeros are black sorrell8 decomposed, zeros are black sorrell8 raw, zeros are white sorrell8 decomposed, zeros are white
889 sp150x300d [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. sp_product sp150x300d raw, zeros are black sp150x300d decomposed, zeros are black sp150x300d raw, zeros are white sp150x300d decomposed, zeros are white
890 sp97ar [MIPLIB] J. Goessens, S. v. Hoessel, L. Kroon Railway line planning instance. Solved with Gurobi 4.5.1 on a 12-core Linux system in 2678.77 sec. sp9 sp97ar raw, zeros are black sp97ar decomposed, zeros are black sp97ar raw, zeros are white sp97ar decomposed, zeros are white
891 sp97ic [MIPLIB] J. Goessens, S. v. Hoessel, L. Kroon Railway line planning instance sp9 sp97ic raw, zeros are black sp97ic decomposed, zeros are black sp97ic raw, zeros are white sp97ic decomposed, zeros are white
892 sp98ar [MIPLIB] J. Goessens, S. v. Hoessel, L. Kroon Railway line planning instance sp9 sp98ar raw, zeros are black sp98ar decomposed, zeros are black sp98ar raw, zeros are white sp98ar decomposed, zeros are white
893 sp98ic [MIPLIB] J. Goessens, S. v. Hoessel, L. Kroon Railway line planning instance sp9 sp98ic raw, zeros are black sp98ic decomposed, zeros are black sp98ic raw, zeros are white sp98ic decomposed, zeros are white
894 sp98ir [MIPLIB] J. Goessens, S. v. Hoessel, L. Kroon Railway line planning instance sp9 sp98ir raw, zeros are black sp98ir decomposed, zeros are black sp98ir raw, zeros are white sp98ir decomposed, zeros are white
895 splice1k1 [MIPLIB] Gleb Belov Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 splice splice1k1 raw, zeros are black splice1k1 decomposed, zeros are black splice1k1 raw, zeros are white splice1k1 decomposed, zeros are white
896 splice1k1i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 splice splice1k1i raw, zeros are black splice1k1i decomposed, zeros are black splice1k1i raw, zeros are white splice1k1i decomposed, zeros are white
897 square23 [MIPLIB] Sascha Kurz Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) square square23 raw, zeros are black square23 decomposed, zeros are black square23 raw, zeros are white square23 decomposed, zeros are white
898 square31 [MIPLIB] Sascha Kurz Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) square square31 raw, zeros are black square31 decomposed, zeros are black square31 raw, zeros are white square31 decomposed, zeros are white
899 square37 [MIPLIB] Sascha Kurz Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) square square37 raw, zeros are black square37 decomposed, zeros are black square37 raw, zeros are white square37 decomposed, zeros are white
900 square41 [MIPLIB] Sascha Kurz Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) square square41 raw, zeros are black square41 decomposed, zeros are black square41 raw, zeros are white square41 decomposed, zeros are white
901 square47 [MIPLIB] Sascha Kurz Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) square square47 raw, zeros are black square47 decomposed, zeros are black square47 raw, zeros are white square47 decomposed, zeros are white
902 stein15inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. stein stein15inf raw, zeros are black stein15inf decomposed, zeros are black stein15inf raw, zeros are white stein15inf decomposed, zeros are white
903 stein45inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. stein stein45inf raw, zeros are black stein45inf decomposed, zeros are black stein45inf raw, zeros are white stein45inf decomposed, zeros are white
904 stein9inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. stein stein9inf raw, zeros are black stein9inf decomposed, zeros are black stein9inf raw, zeros are white stein9inf decomposed, zeros are white
905 stoch-vrpvrp-s5v2c8vrp-v2c8i [MIPLIB] Gleb Belov These are the instances 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 instances can only be handled by solvers accepting indicator constraints. For instances 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 instances with full paths to mzn/dzn files of each instance 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 instance 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 vrp stoch-vrpvrp-s5v2c8vrp-v2c8i raw, zeros are black stoch-vrpvrp-s5v2c8vrp-v2c8i decomposed, zeros are black stoch-vrpvrp-s5v2c8vrp-v2c8i raw, zeros are white stoch-vrpvrp-s5v2c8vrp-v2c8i decomposed, zeros are white
906 stockholm [MIPLIB] Paul Rubin Toll booth placement problem - stockholm raw, zeros are black stockholm decomposed, zeros are black stockholm raw, zeros are white stockholm decomposed, zeros are white
907 stp3d [MIPLIB] T. Koch Steiner tree packing instance in a 3 dimensional grid-graph, LP relaxation is highly degenerate. Alkis Vazacopoulos reports finding the first feasible solution of this instance using XPRESS 2006B. This instance was solved by a first implementation of ParaSCIP using up to 2048 cores of HLRN-II(http://www.hlrn.de). ParaSCIP, mainly developed by Yuji Shinano, is an extension of SCIP and realizes a parallelization on a distributed memory computing environment. For being able to interrupt and warmstart the computations, ParaSCIP has a checkpoint mechanism. Therefore, selected subproblems are stored as warm start information, which allows to virtually run ParaSCIP, although the HLRN-II environment imposes a time limit of 48 hours per run. The problem was presolved several times with SCIP presolving techniques. After that, it took approximately 114 hours to solve this instance. - stp3d raw, zeros are black stp3d decomposed, zeros are black stp3d raw, zeros are white stp3d decomposed, zeros are white
908 supportcase1 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase1 raw, zeros are black supportcase1 decomposed, zeros are black supportcase1 raw, zeros are white supportcase1 decomposed, zeros are white
909 supportcase10 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase10 raw, zeros are black supportcase10 decomposed, zeros are black supportcase10 raw, zeros are white supportcase10 decomposed, zeros are white
910 supportcase12 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase12 raw, zeros are black supportcase12 decomposed, zeros are black supportcase12 raw, zeros are white supportcase12 decomposed, zeros are white
911 supportcase14 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase14 raw, zeros are black supportcase14 decomposed, zeros are black supportcase14 raw, zeros are white supportcase14 decomposed, zeros are white
912 supportcase16 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase16 raw, zeros are black supportcase16 decomposed, zeros are black supportcase16 raw, zeros are white supportcase16 decomposed, zeros are white
913 supportcase17 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase17 raw, zeros are black supportcase17 decomposed, zeros are black supportcase17 raw, zeros are white supportcase17 decomposed, zeros are white
914 supportcase18 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase18 raw, zeros are black supportcase18 decomposed, zeros are black supportcase18 raw, zeros are white supportcase18 decomposed, zeros are white
915 supportcase19 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase19 raw, zeros are black supportcase19 decomposed, zeros are black supportcase19 raw, zeros are white supportcase19 decomposed, zeros are white
916 supportcase2 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase2 raw, zeros are black supportcase2 decomposed, zeros are black supportcase2 raw, zeros are white supportcase2 decomposed, zeros are white
917 supportcase20 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase20 raw, zeros are black supportcase20 decomposed, zeros are black supportcase20 raw, zeros are white supportcase20 decomposed, zeros are white
918 supportcase21i [MIPLIB] Michael Winkler MIP with Indicator instances collected from Gurobi forum with unknown application - supportcase21i raw, zeros are black supportcase21i decomposed, zeros are black supportcase21i raw, zeros are white supportcase21i decomposed, zeros are white
919 supportcase22 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase22 raw, zeros are black supportcase22 decomposed, zeros are black supportcase22 raw, zeros are white supportcase22 decomposed, zeros are white
920 supportcase23 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase23 raw, zeros are black supportcase23 decomposed, zeros are black supportcase23 raw, zeros are white supportcase23 decomposed, zeros are white
921 supportcase25 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase25 raw, zeros are black supportcase25 decomposed, zeros are black supportcase25 raw, zeros are white supportcase25 decomposed, zeros are white
922 supportcase26 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase26 raw, zeros are black supportcase26 decomposed, zeros are black supportcase26 raw, zeros are white supportcase26 decomposed, zeros are white
923 supportcase27i [MIPLIB] Michael Winkler MIP with Indicator instances collected from Gurobi forum with unknown application - supportcase27i raw, zeros are black supportcase27i decomposed, zeros are black supportcase27i raw, zeros are white supportcase27i decomposed, zeros are white
924 supportcase28i [MIPLIB] Michael Winkler MIP with Indicator instances collected from Gurobi forum with unknown application - supportcase28i raw, zeros are black supportcase28i decomposed, zeros are black supportcase28i raw, zeros are white supportcase28i decomposed, zeros are white
925 supportcase29 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. - supportcase29 raw, zeros are black supportcase29 decomposed, zeros are black supportcase29 raw, zeros are white supportcase29 decomposed, zeros are white
926 supportcase3 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application Solved with ParaSCIP in 1551 seconds with 71 solvers(72 cores). - supportcase3 raw, zeros are black supportcase3 decomposed, zeros are black supportcase3 raw, zeros are white supportcase3 decomposed, zeros are white
927 supportcase30 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. - supportcase30 raw, zeros are black supportcase30 decomposed, zeros are black supportcase30 raw, zeros are white supportcase30 decomposed, zeros are white
928 supportcase31 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. - supportcase31 raw, zeros are black supportcase31 decomposed, zeros are black supportcase31 raw, zeros are white supportcase31 decomposed, zeros are white
929 supportcase33 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. - supportcase33 raw, zeros are black supportcase33 decomposed, zeros are black supportcase33 raw, zeros are white supportcase33 decomposed, zeros are white
930 supportcase34 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. - supportcase34 raw, zeros are black supportcase34 decomposed, zeros are black supportcase34 raw, zeros are white supportcase34 decomposed, zeros are white
931 supportcase35 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. - supportcase35 raw, zeros are black supportcase35 decomposed, zeros are black supportcase35 raw, zeros are white supportcase35 decomposed, zeros are white
932 supportcase37 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. - supportcase37 raw, zeros are black supportcase37 decomposed, zeros are black supportcase37 raw, zeros are white supportcase37 decomposed, zeros are white
933 supportcase39 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. - supportcase39 raw, zeros are black supportcase39 decomposed, zeros are black supportcase39 raw, zeros are white supportcase39 decomposed, zeros are white
934 supportcase4 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase4 raw, zeros are black supportcase4 decomposed, zeros are black supportcase4 raw, zeros are white supportcase4 decomposed, zeros are white
935 supportcase40 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. - supportcase40 raw, zeros are black supportcase40 decomposed, zeros are black supportcase40 raw, zeros are white supportcase40 decomposed, zeros are white
936 supportcase41 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. - supportcase41 raw, zeros are black supportcase41 decomposed, zeros are black supportcase41 raw, zeros are white supportcase41 decomposed, zeros are white
937 supportcase42 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. - supportcase42 raw, zeros are black supportcase42 decomposed, zeros are black supportcase42 raw, zeros are white supportcase42 decomposed, zeros are white
938 supportcase43 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. - supportcase43 raw, zeros are black supportcase43 decomposed, zeros are black supportcase43 raw, zeros are white supportcase43 decomposed, zeros are white
939 supportcase6 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase6 raw, zeros are black supportcase6 decomposed, zeros are black supportcase6 raw, zeros are white supportcase6 decomposed, zeros are white
940 supportcase7 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application - supportcase7 raw, zeros are black supportcase7 decomposed, zeros are black supportcase7 raw, zeros are white supportcase7 decomposed, zeros are white
941 swath [MIPLIB] D. Panton Model arising from the defense industry, involves planning missions for radar surveillance. John Forrest and Laszlo Ladanyi solved this instance by reformulation in 1999. Alkis Vazacopoulos reports solving this instance using XPRESS 2006B. swath swath raw, zeros are black swath decomposed, zeros are black swath raw, zeros are white swath decomposed, zeros are white
942 swath1 [MIPLIB] D. Panton Model arising from the defense industry, involves planning missions for radar surveillance. swath swath1 raw, zeros are black swath1 decomposed, zeros are black swath1 raw, zeros are white swath1 decomposed, zeros are white
943 swath2 [MIPLIB] D. Panton Model arising from the defense industry, involves planning missions for radar surveillance. swath swath2 raw, zeros are black swath2 decomposed, zeros are black swath2 raw, zeros are white swath2 decomposed, zeros are white
944 swath3 [MIPLIB] D. Panton Model arising from the defense industry, involves planning missions for radar surveillance. swath swath3 raw, zeros are black swath3 decomposed, zeros are black swath3 raw, zeros are white swath3 decomposed, zeros are white
945 t11nonreg [MIPLIB] Sujayandra Vaddagiri RoutingProblem - t11nonreg raw, zeros are black t11nonreg decomposed, zeros are black t11nonreg raw, zeros are white t11nonreg decomposed, zeros are white
946 t1717 [MIPLIB] R. Borndörfer Vehicle scheduling set partitioning problem from Berlin's Telebus handicapped people's transportation system - t1717 raw, zeros are black t1717 decomposed, zeros are black t1717 raw, zeros are white t1717 decomposed, zeros are white
947 t1722 [MIPLIB] R. Borndörfer Vehicle scheduling set partitioning problem from Berlin's Telebus handicapped people's transportation system - t1722 raw, zeros are black t1722 decomposed, zeros are black t1722 raw, zeros are white t1722 decomposed, zeros are white
948 ta1-UUM [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. network_design ta1-UUM raw, zeros are black ta1-UUM decomposed, zeros are black ta1-UUM raw, zeros are white ta1-UUM decomposed, zeros are white
949 ta2-UUE [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. network_design ta2-UUE raw, zeros are black ta2-UUE decomposed, zeros are black ta2-UUE raw, zeros are white ta2-UUE decomposed, zeros are white
950 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). huefner tanglegram4 raw, zeros are black tanglegram4 decomposed, zeros are black tanglegram4 raw, zeros are white tanglegram4 decomposed, zeros are white
951 tanglegram6 [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). huefner tanglegram6 raw, zeros are black tanglegram6 decomposed, zeros are black tanglegram6 raw, zeros are white tanglegram6 decomposed, zeros are white
952 tbfp-bigm [MIPLIB] Rob Pratt Two formulations (big-M and network-based) for traveling baseball fan problem. Uses data from 2014 Major League Baseball regular season. Paper uses 2014 data: http://support.sas.com/resources/papers/proceedings14/SAS101-2014.pdf Blog post uses 2015 data: http://blogs.sas.com/content/operations/2015/04/03/the-traveling-baseball-fan-problem/ - tbfp-bigm raw, zeros are black tbfp-bigm decomposed, zeros are black tbfp-bigm raw, zeros are white tbfp-bigm decomposed, zeros are white
953 tbfp-network [MIPLIB] Rob Pratt Two formulations (big-M and network-based) for traveling baseball fan problem. Uses data from 2014 Major League Baseball regular season. Paper uses 2014 data: http://support.sas.com/resources/papers/proceedings14/SAS101-2014.pdf Blog post uses 2015 data: http://blogs.sas.com/content/operations/2015/04/03/the-traveling-baseball-fan-problem/ - tbfp-network raw, zeros are black tbfp-network decomposed, zeros are black tbfp-network raw, zeros are white tbfp-network decomposed, zeros are white
954 Test3 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - Test3 raw, zeros are black Test3 decomposed, zeros are black Test3 raw, zeros are white Test3 decomposed, zeros are white
955 thor50dday [MIPLIB] Daniel Rehfeldt Steiner tree problem in graphs instance, consisting of a complete graph with 231 vertices of which 50 are terminals. The vertices correspond to cities (mostly capitals) around the world, the edges weights correspond to the distances in km. - thor50dday raw, zeros are black thor50dday decomposed, zeros are black thor50dday raw, zeros are white thor50dday decomposed, zeros are white
956 timtab1 [MIPLIB] C. Liebchen, R. Möhring Public transport scheduling problem timtab timtab1 raw, zeros are black timtab1 decomposed, zeros are black timtab1 raw, zeros are white timtab1 decomposed, zeros are white
957 timtab1CUTS [MIPLIB] C. Liebchen, R. Möhring Public transport scheduling problem timtab timtab1CUTS raw, zeros are black timtab1CUTS decomposed, zeros are black timtab1CUTS raw, zeros are white timtab1CUTS decomposed, zeros are white
958 tokyometro [MIPLIB] Hsiang-Yun WU The layout model for Tokyo Metro Map - tokyometro raw, zeros are black tokyometro decomposed, zeros are black tokyometro raw, zeros are white tokyometro decomposed, zeros are white
959 toll-like [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). Solved by Gurobi 4.6 (8 threads) in about four days after a variable transformation reducing symmetry. huefner toll-like raw, zeros are black toll-like decomposed, zeros are black toll-like raw, zeros are white toll-like decomposed, zeros are white
960 tpl-tub-ss16 [MIPLIB] János Höner Model for the Post-Enrollment Course Timetabling Problem at TU Berlin from the summer term 2016 and the winter term 2016/2017 - tpl-tub-ss16 raw, zeros are black tpl-tub-ss16 decomposed, zeros are black tpl-tub-ss16 raw, zeros are white tpl-tub-ss16 decomposed, zeros are white
961 tpl-tub-ws1617 [MIPLIB] János Höner Model for the Post-Enrollment Course Timetabling Problem at TU Berlin from the summer term 2016 and the winter term 2016/2017 - tpl-tub-ws1617 raw, zeros are black tpl-tub-ws1617 decomposed, zeros are black tpl-tub-ws1617 raw, zeros are white tpl-tub-ws1617 decomposed, zeros are white
962 tr12-30 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - tr12-30 raw, zeros are black tr12-30 decomposed, zeros are black tr12-30 raw, zeros are white tr12-30 decomposed, zeros are white
963 traininstance2 [MIPLIB] Gleb Belov Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 traininstance traininstance2 raw, zeros are black traininstance2 decomposed, zeros are black traininstance2 raw, zeros are white traininstance2 decomposed, zeros are white
964 traininstance6 [MIPLIB] Gleb Belov Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 traininstance traininstance6 raw, zeros are black traininstance6 decomposed, zeros are black traininstance6 raw, zeros are white traininstance6 decomposed, zeros are white
965 transportmoment [MIPLIB] G. Gamrath Transport momentum maximization in a capacitated gas network, cycles are forbidden by pseudo pressures. Solved by Gurobi 4.6.1 (12 threads) in 30 seconds (January 2012). - transportmoment raw, zeros are black transportmoment decomposed, zeros are black transportmoment raw, zeros are white transportmoment decomposed, zeros are white
966 trento1 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. - trento1 raw, zeros are black trento1 decomposed, zeros are black trento1 raw, zeros are white trento1 decomposed, zeros are white
967 triptim1 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. triptim triptim1 raw, zeros are black triptim1 decomposed, zeros are black triptim1 raw, zeros are white triptim1 decomposed, zeros are white
968 triptim2 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. triptim triptim2 raw, zeros are black triptim2 decomposed, zeros are black triptim2 raw, zeros are white triptim2 decomposed, zeros are white
969 triptim4 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. triptim triptim4 raw, zeros are black triptim4 decomposed, zeros are black triptim4 raw, zeros are white triptim4 decomposed, zeros are white
970 triptim8 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. triptim triptim8 raw, zeros are black triptim8 decomposed, zeros are black triptim8 raw, zeros are white triptim8 decomposed, zeros are white
971 tw-myciel4 [MIPLIB] Arie Koster Model to compute the treewidth of the Mycielski-4 instance from the DIMACS graph coloring database. Solved in June 2013 by CPLEX 12.5.1 (12 threads) in about 66 hours. The solving was performed in two steps: first solving with 50 GB tree memory limit (took 11307.42 seconds), after that, setting the tree memory limit to 80 GB and switching to depth first search (took 226152.14 seconds). - tw-myciel4 raw, zeros are black tw-myciel4 decomposed, zeros are black tw-myciel4 raw, zeros are white tw-myciel4 decomposed, zeros are white
972 uccase10 [MIPLIB] Daniel Espinoza Imported from the MIPLIB2010 submissions. uccase uccase10 raw, zeros are black uccase10 decomposed, zeros are black uccase10 raw, zeros are white uccase10 decomposed, zeros are white
973 uccase12 [MIPLIB] Daniel Espinoza Imported from the MIPLIB2010 submissions. uccase uccase12 raw, zeros are black uccase12 decomposed, zeros are black uccase12 raw, zeros are white uccase12 decomposed, zeros are white
974 uccase7 [MIPLIB] Daniel Espinoza Imported from the MIPLIB2010 submissions. uccase uccase7 raw, zeros are black uccase7 decomposed, zeros are black uccase7 raw, zeros are white uccase7 decomposed, zeros are white
975 uccase8 [MIPLIB] Daniel Espinoza Imported from the MIPLIB2010 submissions. uccase uccase8 raw, zeros are black uccase8 decomposed, zeros are black uccase8 raw, zeros are white uccase8 decomposed, zeros are white
976 uccase9 [MIPLIB] Daniel Espinoza Imported from the MIPLIB2010 submissions. uccase uccase9 raw, zeros are black uccase9 decomposed, zeros are black uccase9 raw, zeros are white uccase9 decomposed, zeros are white
977 uct-subprob [MIPLIB] Gerald Lach Subproblem of a university course timetabling problem. Switched to "easy" because it was solved by Gurobi 5.0 in 2106 seconds (May 2012). - uct-subprob raw, zeros are black uct-subprob decomposed, zeros are black uct-subprob raw, zeros are white uct-subprob decomposed, zeros are white
978 umts [MIPLIB] C. Polo Telecommunications network model - umts raw, zeros are black umts decomposed, zeros are black umts raw, zeros are white umts decomposed, zeros are white
979 unitcal_7 [MIPLIB] R. O’Neill California seven day unit commitment problem - unitcal_7 raw, zeros are black unitcal_7 decomposed, zeros are black unitcal_7 raw, zeros are white unitcal_7 decomposed, zeros are white
980 usAbbrv-8-25_70 [MIPLIB] publicly available Imported from MIPLIB2010. - usAbbrv-8-25_70 raw, zeros are black usAbbrv-8-25_70 decomposed, zeros are black usAbbrv-8-25_70 raw, zeros are white usAbbrv-8-25_70 decomposed, zeros are white
981 v150d30-2hopcds [MIPLIB] 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, instances with as few as 120 variables are left unsolved after one hour using Gurobi 7.0.2. 2hopcds v150d30-2hopcds raw, zeros are black v150d30-2hopcds decomposed, zeros are black v150d30-2hopcds raw, zeros are white v150d30-2hopcds decomposed, zeros are white
982 van [MIPLIB] C. Mannino, E. Parrello Telecommunications network model - van raw, zeros are black van decomposed, zeros are black van raw, zeros are white van decomposed, zeros are white
983 var-smallemery-m6j6 [MIPLIB] Daniel Espinoza Imported from the MIPLIB2010 submissions. - var-smallemery-m6j6 raw, zeros are black var-smallemery-m6j6 decomposed, zeros are black var-smallemery-m6j6 raw, zeros are white var-smallemery-m6j6 decomposed, zeros are white
984 vpphard [MIPLIB] C. Cardonha Vehicle positioning problem instance - vpphard raw, zeros are black vpphard decomposed, zeros are black vpphard raw, zeros are white vpphard decomposed, zeros are white
985 vpphard2 [MIPLIB] C. Cardonha Vehicle positioning problem instance. Solved using CPLEX 12.4 in 43987 seconds (May 2012). Solved using Gurobi 5.6.2 in 124 seconds (May 2014).Solved using CPLEX 12.6 in 225 seconds (May 2014). - vpphard2 raw, zeros are black vpphard2 decomposed, zeros are black vpphard2 raw, zeros are white vpphard2 decomposed, zeros are white
986 wachplan [MIPLIB] Sebastian Orlowski Shift planning model to assign crew members to shifts for a sail training trip - wachplan raw, zeros are black wachplan decomposed, zeros are black wachplan raw, zeros are white wachplan decomposed, zeros are white
987 wnq-n100-mw99-14 [MIPLIB] M. Winkler Weighted n-queens problem with an additional separation constraint. Solved by Gurobi 4.6.1 (12 threads) in 28124 seconds (January 2012). - wnq-n100-mw99-14 raw, zeros are black wnq-n100-mw99-14 decomposed, zeros are black wnq-n100-mw99-14 raw, zeros are white wnq-n100-mw99-14 decomposed, zeros are white
988 woodlands09 [MIPLIB] George Fonseca Educational timetabling problems from several real schools/universities around the world. These instances were originally expressed in the xhstt file format [1] and formulated as Integer Programming models as described at [2]. timetabling woodlands09 raw, zeros are black woodlands09 decomposed, zeros are black woodlands09 raw, zeros are white woodlands09 decomposed, zeros are white
989 xmas10 [MIPLIB] Simon Felix An ILP formulation of\xa0an FHNW puzzle (a mix of longest path and a flow problem). - xmas10 raw, zeros are black xmas10 decomposed, zeros are black xmas10 raw, zeros are white xmas10 decomposed, zeros are white
990 xmas10-2 [MIPLIB] Simon Felix Another formulation of\xa0an FHNW puzzle (Mix of longest path and flow problem) (Known bounds:\xa0497-511) - xmas10-2 raw, zeros are black xmas10-2 decomposed, zeros are black xmas10-2 raw, zeros are white xmas10-2 decomposed, zeros are white
991 z26 [MIPLIB] Daniel Bienstock Set packing problem arising from the ongoing "Frequency Spectrum Auction" in the U.S. Work is collaboration with Ion Media Networks, Inc. - z26 raw, zeros are black z26 decomposed, zeros are black z26 raw, zeros are white z26 decomposed, zeros are white
992 zeil [MIPLIB] Andreas Bärmann A model that computes an optimal adaptation of a given timetable draft for a small portion of the German railway network. The aim is to shift the planned departure times of the trains slightly, such that the maximum power consumption (averaed over 15-minute intervalls of the planning horizon) is as small as possible. - zeil raw, zeros are black zeil decomposed, zeros are black zeil raw, zeros are white zeil decomposed, zeros are white
Updated August 16, 2019