Problems with unknown feasibility

[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
Open datt256 CBP 11077 262144 1503732 262144 ?     X     X X            
Open neos-952987 CBP 354 31329 90384 31329 ?         X   X   X X      
Easy ns1778858 CBP 10666 4720 32673 4720 -2.26357e+07  X X           X     X  
Open ns1905800 C MIP 8289 3228 38100 3 3030 195 ?   X X     X           X X
Open zib01 CXBP 5887041 12471400 49877768 12471400 ?     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


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

VBDVariable Bound
PARSet Partition
PACSet Packing
COVSet Cover
EQKEquality Knapsack
BINBin Packing
IVKInvariant Knapsack
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 July 31, 2019 by Gerald Gamrath
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)