MIPLIB 2010


Hard problems

[Return to complete MIPLIB 2010 problem list]

Click here for legend of abbreviations and links to subsets

Status Name Sets C Rows Cols NZs Int Bin Con Objective AGG VBD PAR PAC COV CAR EQK BIN IVK KNA IKN M01 GEN
Hard a1c1s1 C MBP 3312 3648 10178 192 3456 11503.4X X                   X  
Hard atm20-100 C MBP 4380 6480 58878 2220 4260 2.46362e+06  X X           X     X  
Hard b2c1s1 C MBP 3904 3872 11408 288 3584 25687.9X X                   X  
Hard bnatt400 CRBP 5614 3600 21698 3600 1        X       X     X  
Hard d10200 C IP 947 2000 57637 1267 733 12430    X           X X      
Hard eilA101-2 CBP 100 65832 959373 65832 880.92    X                    
Hard g200x740i C MBP 940 1480 2960 740 740 30086  X                   X  
Hard go19 CTBP 441 441 1885 441 84        X       X        
Hard leo2 C MBP 593 11100 219959 11099 1 4.04077e+08  X   X X       X     X  
Hard lotsize C MBP 1920 2985 6565 1195 1790 1.4802e+06  X   X         X     X  
Hard lrsa120 C MIP 14521 3839 39956 119 120 3600 Infeasible X X             X     X X
Hard mkc C MBP 3411 5325 17038 5323 2 -563.846  X   X         X     X  
Hard n9-3 C MIP 2364 7644 30072 252 7392 14409X                     X X
Hard neos-847302 T MBP 609 737 9566 729 8 4  X X X               X  
Hard neos-948126 R MBP 7271 9551 38219 6965 2586 2607  X   X         X     X  
Hard ns1696083 CRBP 11063 7982 384129 7982 45  X X X   X     X X   X  
Hard nu120-pr3 C IP 2210 8601 25986 61 8540 28130X X X     X             X
Hard opm2-z10-s2 CBP 160633 6250 371243 6250 -33826  X               X      
Hard opm2-z11-s8 CRBP 223082 8019 510283 8019 -43485  X               X      
Hard opm2-z12-s14 CRBP 319508 10800 725376 10800 -64291  X               X      
Hard opm2-z12-s7 CRBP 319508 10800 725385 10800 -65514  X               X      
Hard p100x588b C MBP 688 1176 2352 588 588 47878  X                   X  
Hard p6b CBP 5852 462 11704 462 -63  X                      
Hard pigeon-12 CT MBP 1333 660 11796 552 108 -11000          X     X X   X  
Hard probportfolio C MBP 302 320 6620 300 20 16.7342                X     X  
Status Name Sets C Rows Cols NZs Int Bin Con Objective AGG VBD PAR PAC COV CAR EQK BIN IVK KNA IKN M01 GEN
Hard protfold RBP 2112 1835 23491 1835 -31    X X X X     X     X  
Hard r80x800 C MBP 880 1600 3200 800 800 5332  X                   X  
Hard rail02 CRBP 95791 270869 756228 270869 -200.45X   X X   X       X      
Hard reblock354 CBP 19906 3540 52901 3540 -3.92805e+07  X               X      
Hard reblock420 CBP 62800 4200 138670 4200 -5.17793e+08  X               X      
Hard rmatr200-p10 C MBP 35055 35254 105362 200 35054 2017          X           X  
Hard rmatr200-p20 C MBP 29406 29605 88415 200 29405 837          X           X  
Hard rmatr200-p5 C MBP 37617 37816 113048 200 37616 4521          X           X  
Hard rococoC11-011100 CR IP 2367 6491 30472 166 6325 20889X X X     X     X       X
Hard satellites3-40-fs CUR MBP 35553 81681 291161 79961 1720 -25X X X X   X           X  
Hard satellites3-40 CUR MBP 44804 81681 698176 79961 1720 -25X X X X   X     X     X  
Hard seymour CBP 4944 1372 33549 1372 423  X     X       X        
Hard seymour-disj-10 CBP 5108 1209 64704 1209 287  X     X       X     X  
Hard stp3d CRBP 159488 204880 662128 204880 493.72  X X X   X              
Hard swath C MBP 884 6805 34965 6724 81 467.407    X     X           X  
Hard toll-like CBP 4408 2883 13224 2883 610        X       X        
Hard wnq-n100-mw99-14 CTBP 656900 10000 1333400 10000 259  X     X       X        
Hard zib02 CIXBP 9049868 37709944 146280582 37709944 Infeasible   X X X   X              
Status Name Sets C Rows Cols NZs Int Bin Con Objective AGG VBD PAR PAC COV CAR EQK BIN IVK KNA IKN M01 GEN

Legend

Problem Status

Easy Easy - instance can be solved within one hour using a commercial solver
Hard Hard - instance has been solved, but is not considered easy
Open Open - optimal solution to instance is unknown

Instance Set List

BBenchmark set
CChallenge set
IInfeasible set
PPrimal set
UUnstable set
R Reoptimize set
T Tree set
XXXL - extra large instances

Problem Type List

BPBinary Program - All variables are binary
IP Integer Program - All variables are integer
MBP Mixed Binary Program - All variables are binary or continuous
MIPMixed Integer Program - Variables can be integer or continuous

Note: The problem types are used to partition the instances. Instances that match more than one type are grouped into the least general set.

Problem Feasibility List

Feasible Problems - a feasible solution is known
Infeasible Problems - the problem was proven to be infeasible
Unknown Feasiblility - no feasible solution is know, but the problem was not proven to be infeasible

Constraint Type Legend

AGGAggregation
VBDVariable Bound
PARSet Partition
PACSet Packing
COVSet Cover
CARCardinality
EQKEquality Knapsack
BINBin Packing
IVKInvariant Knapsack
KNAKnapsack
IKNInteger Knapsack
M01Mixed Binary
GENGeneralAll other constraint types

Note: If a constraint matches more than one type, it is counted for the one with highest priority (lowest number).
Scaling and negation of binary are applied to match constraint types.

Last Update May 14th, 2012 by Gerald Gamrath
© 2012 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint